Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
129 tokens/sec
GPT-4o
28 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Multi-Agent Clarity-Aware Dynamic Coverage with Gaussian Processes (2403.17917v2)

Published 26 Mar 2024 in eess.SY, cs.RO, and cs.SY

Abstract: This paper presents two algorithms for multi-agent dynamic coverage in spatiotemporal environments, where the coverage algorithms are informed by the method of data assimilation. In particular, we show that by explicitly modeling the environment using a Gaussian Process (GP) model, and considering the sensing capabilities and the dynamics of a team of robots, we can design an estimation algorithm and multi-agent coverage controller that explores and estimates the state of the spatiotemporal environment. The uncertainty of the estimate is quantified using clarity, an information-theoretic metric, where higher clarity corresponds to lower uncertainty. By exploiting the relationship between GPs and Stochastic Differential Equations (SDEs) we quantify the increase in clarity of the estimated state at any position due to a measurement taken from any other position. We use this relationship to design two new coverage controllers, both of which scale well with the number of agents exploring the domain, assuming the robots can share the map of the clarity over the spatial domain via communication. We demonstrate the algorithms through a realistic simulation of a team of robots collecting wind data over a region in Austria.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (19)
  1. J. Liang, M. Liu, and X. Kui, “A survey of coverage problems in wireless sensor networks,” Sensors & Transducers, vol. 163, no. 1, p. 240, 2014.
  2. S. Oktug, A. Khalilov, and H. Tezcan, “3d coverage analysis under heterogeneous deployment strategies in wireless sensor networks,” in 2008 Fourth Advanced International Conference on Telecommunications.   IEEE, 2008, pp. 199–204.
  3. W. Bentz, “Dynamic coverage control and estimation in collaborative networks of human-aerial/space co-robots,” Ph.D. dissertation, University of Michigan, Ann Arbor, 2020.
  4. J. Cortes, S. Martinez, T. Karatas, and F. Bullo, “Coverage control for mobile sensing networks,” IEEE Transactions on robotics and Automation, vol. 20, no. 2, pp. 243–255, 2004.
  5. B. Moon, S. Chatterjee, and S. Scherer, “Tigris: An informed sampling-based algorithm for informative path planning,” in 2022 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).   IEEE, 2022, pp. 5760–5766.
  6. A. Bry and N. Roy, “Rapidly-exploring random belief trees for motion planning under uncertainty,” in 2011 IEEE international conference on robotics and automation.   IEEE, 2011, pp. 723–730.
  7. N. Cao, K. H. Low, and J. M. Dolan, “Multi-robot informative path planning for active sensing of environmental phenomena: A tale of two algorithms,” arXiv preprint arXiv:1302.0723, 2013.
  8. C. Xiao and J. Wachs, “Nonmyopic informative path planning based on global kriging variance minimization,” IEEE Robotics and Automation Letters, vol. 7, no. 2, pp. 1768–1775, 2022.
  9. G. Mathew and I. Mezić, “Metrics for ergodicity and design of ergodic dynamics for multi-agent systems,” Physica D: Nonlinear Phenomena, vol. 240, no. 4-5, pp. 432–442, 2011.
  10. L. Dressel and M. J. Kochenderfer, “Tutorial on the generation of ergodic trajectories with projection-based gradient descent,” IET Cyber-Physical Systems: Theory & Applications, vol. 4, no. 2, pp. 89–100, 2019.
  11. S. Sarkka and J. Hartikainen, “Infinite-dimensional kalman filtering approach to spatio-temporal gaussian process regression,” in Artificial intelligence and statistics.   PMLR, 2012, pp. 993–1001.
  12. A. Küper and S. Waldherr, “Numerical gaussian process kalman filtering for spatiotemporal systems,” IEEE Transactions on Automatic Control, vol. 68, no. 5, pp. 3131–3138, 2022.
  13. D. R. Agrawal and D. Panagou, “Sensor-based planning and control for robotic systems: Introducing clarity and perceivability,” IEEE Control Systems Letters, 2023.
  14. Z. Chen, J. Fan, and K. Wang, “Multivariate gaussian processes: definitions, examples and applications,” Metron, vol. 81, no. 2, pp. 181–191, 2023.
  15. K. Tracy, “A square-root kalman filter using only qr decompositions,” arXiv preprint arXiv:2208.06452, 2022.
  16. D. Dong, H. Berger, and I. Abraham, “Time optimal ergodic search,” arXiv preprint arXiv:2305.11643, 2023.
  17. K. B. Naveed, D. Agrawal, C. Vermillion, and D. Panagou, “Eclares: Energy-aware clarity-driven ergodic search.”   IEEE, 2024.
  18. C. Schlager, G. Kirchengast, and J. Fuchsberger, “Generation of high-resolution wind fields from the wegenernet dense meteorological station network in southeastern austria,” Weather and Forecasting, vol. 32, no. 4, pp. 1301–1319, 2017.
  19. R. B. Christianson, R. M. Pollyea, and R. B. Gramacy, “Traditional kriging versus modern gaussian processes for large-scale mining data,” Statistical Analysis and Data Mining: The ASA Data Science Journal, vol. 16, no. 5, pp. 488–506, 2023.

Summary

We haven't generated a summary for this paper yet.

X Twitter Logo Streamline Icon: https://streamlinehq.com