Communication-Aware Map Compression for Online Path-Planning
Abstract: This paper addresses the problem of the communication of optimally compressed information for mobile robot path-planning. In this context, mobile robots compress their current local maps to assist another robot in reaching a target in an unknown environment. We propose a framework that sequentially selects the optimal compression, guided by the robot's path, by balancing the map resolution and communication cost. Our approach is tractable in close-to-real scenarios and does not necessitate prior environment knowledge. We design a novel decoder that leverages compressed information to estimate the unknown environment via convex optimization with linear constraints and an encoder that utilizes the decoder to select the optimal compression. Numerical simulations are conducted in a large close-to-real map and a maze map and compared with two alternative approaches. The results confirm the effectiveness of our framework in assisting the robot reach its target by reducing transmitted information, on average, by approximately 50% while maintaining satisfactory performance.
- H. Sugiyama, T. Tsujioka, and M. Murata, “Collaborative movement of rescue robots for reliable and effective networking in disaster area,” in International Conference on Collaborative Computing: Networking, Applications and Worksharing, San Jose, CA, Dec. 19-22, 2005.
- O. Salzman and R. Stern, “Research challenges and opportunities in multi-agent path finding and multi-agent pickup and delivery problems,” in 19th International Conference on Autonomous Agents and MultiAgent Systems, Auckland, New Zealand, May 9-13, 2020, pp. 1711–1715.
- S. B. Kesner, J.-S. Plante, P. J. Boston, T. Fabian, and S. Dubowsky, “Mobility and power feasibility of a microbot team system for extraterrestrial cave exploration,” in IEEE International Conference on Robotics and Automation (ICRA), Rome, Italy, April 10-14, 2007, pp. 4893–4898.
- J. Gielis, A. Shankar, and A. Prorok, “A critical review of communications in multi-robot systems,” Current Robotics Reports, vol. 3, no. 4, pp. 213–225, Aug. 2022.
- M. E. Kepler and D. J. Stilwell, “An approach to reduce communication for multi-agent mapping applications,” in IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), Las Vegas, NV, Oct. 25-January 24, 2020-2021, pp. 4814–4820.
- Y. Chang, L. Ballotta, and L. Carlone, “D-lite: Navigation-oriented compression of 3d scene graphs under communication constraints,” 2023, arXiv:2209.06111.
- D. F. Delchamps, “Stabilizing a linear system with quantized state feedback,” IEEE Transactions on Automatic Control, vol. 35, no. 8, pp. 916–924, Aug. 1990.
- R. W. Brockett and D. Liberzon, “Quantized feedback stabilization of linear systems,” IEEE Transactions on Automatic Control, vol. 45, no. 7, pp. 1279–1289, July 2000.
- G. N. Nair and R. J. Evans, “Stabilizability of stochastic linear systems with finite feedback data rates,” SIAM Journal on Control and Optimization, vol. 43, no. 2, pp. 413–436, July 2004.
- V. Kostina and B. Hassibi, “Rate-cost tradeoffs in control,” IEEE Transactions on Automatic Control, vol. 64, no. 11, pp. 4525–4540, Nov. 2019.
- M. Fu, “Lack of separation principle for quantized linear quadratic gaussian control,” IEEE Transactions on Automatic Control, vol. 57, no. 9, pp. 2385–2390, Sept. 2012.
- S. Yüksel, “A note on the separation of optimal quantization and control policies in networked control,” SIAM Journal on Control and Optimization, vol. 57, no. 1, pp. 773–782, 2019.
- D. Maity and P. Tsiotras, “Optimal controller synthesis and dynamic quantizer switching for linear-quadratic-Gaussian systems,” IEEE Transactions on Automatic Control, vol. 67, no. 1, pp. 382–389, Jan. 2022.
- ——, “Optimal quantizer scheduling and controller synthesis for partially observable linear systems,” SIAM Journal on Control and Optimization, vol. 61, no. 4, pp. 2682–2707, Aug. 2023.
- V. Unhelkar and J. Shah, “Contact: Deciding to communicate during time-critical collaborative tasks in unknown, deterministic domains,” in AAAI Conference on Artificial Intelligence, Phoenix, AZ, Feb. 12-17, 2016.
- F. Wu, S. Zilberstein, and X. Chen, “Online planning for multi-agent systems with bounded communication,” Artificial Intelligence, vol. 175, no. 2, pp. 487–511, Feb. 2011.
- R. Marcotte, X. Wang, D. Mehta, and E. Olson, “Optimizing multi-robot communication under bandwidth constraints,” Autonomous Robots, vol. 44, no. 1, pp. 43–55, Jan. 2020.
- Q. Li, F. Gama, A. Ribeiro, and A. Prorok, “Graph neural networks for decentralized multi-robot path planning,” in IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), Macau, China, Nov. 4-8, 2019, pp. 11 785–11 792.
- R. V. Cowlagi and P. Tsiotras, “Multiresolution motion planning for autonomous agents via wavelet-based cell decompositions,” IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), vol. 42, no. 5, pp. 1455–1469, Oct. 2012.
- G. K. Kraetzschmar, G. P. Gassull, and K. Uhl, “Probabilistic quadtrees for variable-resolution mapping of large environments,” IFAC Proceedings Volumes, vol. 37, no. 8, pp. 675–680, July 2004.
- D. T. Larsson, D. Maity, and P. Tsiotras, “Q-tree search: An information-theoretic approach toward hierarchical abstractions for agents with computational limitations,” IEEE Transactions on Robotics, vol. 36, no. 6, pp. 1669–1685, Dec. 2020.
- ——, “Information-theoretic abstractions for planning in agents with computational constraints,” IEEE Robotics and Automation Letters, vol. 6, no. 4, pp. 7651–7658, Oct. 2021.
- E. W. Dijkstra, “A note on two problems in connexion with graphs,” Numerische Mathematik, vol. 1, no. 1, pp. 269–271, Dec. 1959.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.