Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 77 tok/s
Gemini 2.5 Pro 56 tok/s Pro
GPT-5 Medium 34 tok/s Pro
GPT-5 High 35 tok/s Pro
GPT-4o 103 tok/s Pro
Kimi K2 208 tok/s Pro
GPT OSS 120B 462 tok/s Pro
Claude Sonnet 4.5 36 tok/s Pro
2000 character limit reached

Cooperative Periodic Coverage With Collision Avoidance (2401.13622v1)

Published 24 Jan 2024 in cs.RO, cs.SY, and eess.SY

Abstract: In this paper we propose a periodic solution to the problem of persistently covering a finite set of interest points with a group of autonomous mobile agents. These agents visit periodically the points and spend some time carrying out the coverage task, which we call coverage time. Since this periodic persistent coverage problem is NP-hard, we split it into three subproblems to counteract its complexity. In the first place, we plan individual closed paths for the agents to cover all the points. Second, we formulate a quadratically constrained linear program to find the optimal coverage times and actions that satisfy the coverage objective. Finally, we join together the individual plans of the agents in a periodic team plan by obtaining a schedule that guarantees collision avoidance. To this end, we solve a mixed integer linear program that minimizes the time in which two or more agents move at the same time. Eventually, we apply the proposed solution to an induction hob with mobile inductors for a domestic heating application and show its performance with experiments on a real prototype.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (34)
  1. A. Khamis, A. Hussein, and A. Elmogy, “Multi-robot task allocation: A review of the state-of-the-art,” Studies in Computational Intelligence, vol. 604, pp. 31–51, 2015.
  2. I. I. Hussein and D. M. Stipanovic, “Effective Coverage Control for Mobile Sensor Networks With Guaranteed Collision Avoidance,” IEEE Trans. on Control Systems Technology, vol. 15, no. 4, pp. 642–657, 2007.
  3. N. M. Kakalis and Y. Ventikos, “Robotic swarm concept for efficient oil spill confrontation,” J. Hazardous Materials, vol. 154, no. 1, pp. 880–887, 2008.
  4. R. N. Smith, M. Schwager, S. L. Smith, B. H. Jones, D. Rus, and G. S. Sukhatme, “Persistent ocean monitoring with underwater gliders: Adapting sampling resolution,” J. Field Robotics, vol. 28, no. 5, pp. 714–741, 2011.
  5. M. Jadaliha and J. Choi, “Environmental monitoring using autonomous aquatic robots: Sampling algorithms and experiments,” IEEE Transactions on Control Systems Technology, vol. 21, no. 3, pp. 899–905, 2013.
  6. D. Mitchell, N. Chakraborty, K. Sycara, and N. Michael, “Multi-Robot Persistent Coverage with stochastic task costs,” in IEEE/RSJ Int. Conf. Intell. Robots Systems.   IEEE, 2015, pp. 3401–3406.
  7. J. Cortes, S. Martinez, T. Karatas, and F. Bullo, “Coverage control for mobile sensing networks,” IEEE Trans. Robot. Autom., vol. 20, no. 2, pp. 243–255, 2004.
  8. P. F. Hokayem, D. Stipanovic, and M. W. Spong, “On persistent coverage control,” in IEEE Conf. Decision and Control, 2007, pp. 6130–6135.
  9. J. M. Palacios-Gasós, E. Montijano, C. Sagüés, and S. Llorente, “Distributed coverage estimation and control for multi-robot persistent tasks,” IEEE Trans. Robot., vol. 32, no. 6, pp. 1444–1460, 2016.
  10. N. Nigam, S. Bieniawski, I. Kroo, and J. Vian, “Control of multiple UAVs for persistent surveillance: algorithm and flight test results,” IEEE Trans. Control Syst. Technol., vol. 20, no. 5, pp. 1236–1251, 2012.
  11. J. M. Palacios-Gasos, E. Montijano, C. Sagüés, and S. Llorente, “Multi-robot persistent coverage using branch and bound,” in American Control Conf., 2016, pp. 5697––5702.
  12. X. Lin and C. G. Cassandras, “An optimal control approach to the multi-agent persistent monitoring problem in two-dimensional spaces,” in IEEE Conf. Decision and Control, 2013, pp. 6886–6891.
  13. X. Lan and M. Schwager, “Planning periodic persistent monitoring trajectories for sensing robots in gaussian random fields,” in IEEE Int. Conf. Robot. Autom., 2013, pp. 2407–2412.
  14. ——, “Rapidly Exploring Random Cycles: Persistent Estimation of Spatiotemporal Fields With Multiple Sensing Robots,” IEEE Transactions on Robotics, vol. 32, no. 5, pp. 1230–1244, 2016.
  15. D. Portugal, C. Pippin, R. P. Rocha, and H. Christensen, “Finding optimal routes for multi-robot patrolling in generic graphs,” in IEEE/RSJ Int. Conf. Intell. Robots and Systems, 2014, pp. 363–369.
  16. C. Song, L. Liu, G. Feng, Y. Wang, and Q. Gao, “Persistent awareness coverage control for mobile sensor networks,” Automatica, vol. 49, no. 6, pp. 1867–1873, 2013.
  17. G. A. Korsah, A. Stentz, and M. B. Dias, “A comprehensive taxonomy for multi-robot task allocation,” The International Journal of Robotics Research, vol. 32, no. 12, pp. 1495–1512, 2013.
  18. K. Schüpbach and R. Zenklusen, “An adaptive routing approach for personal rapid transit,” Mathematical Methods of Operations Research, vol. 77, no. 3, pp. 371–380, 2013.
  19. J. Kim, B. D. Song, and J. R. Morrison, “On the scheduling of systems of UAVs and fuel service stations for long-term mission fulfillment,” Journal of Intelligent and Robotic Systems: Theory and Applications, vol. 70, no. 1-4, pp. 347–359, 2013.
  20. K. Sundar and S. Rathinam, “Algorithms for Routing an Unmanned Aerial Vehicle in the Presence of Refueling Depots,” IEEE Trans. on Automation Science and Engineering, vol. 11, no. 1, pp. 287–294, 2014.
  21. J. L. Fargeas, B. Hyun, P. Kabamba, and A. Girard, “Persistent visitation under revisit constraints,” in International Conference on Unmanned Aircraft Systems, 2013, pp. 952–957.
  22. D. Mitchell, M. Corah, N. Chakraborty, K. Sycara, and N. Michael, “Multi-robot long-term persistent coverage with fuel constrained robots,” in IEEE Int. Conf. Robot. Autom., 2015, pp. 1093–1099.
  23. J. Yu, M. Schwager, and D. Rus, “Correlated Orienteering Problem and its Application to Persistent Monitoring Tasks,” IEEE Transactions on Robotics, vol. 32, no. 5, pp. 1106–1118, 2016.
  24. N. Nigam, “The Multiple Unmanned Air Vehicle Persistent Surveillance Problem: A Review,” Machines, vol. 2, no. 1, pp. 13–72, 2014.
  25. S. L. Smith, M. Schwager, and D. Rus, “Persistent robotic tasks: Monitoring and sweeping in changing environments,” IEEE Trans. Robot., vol. 28, no. 2, pp. 410–426, 2012.
  26. J. M. Palacios-Gasós, E. Montijano, C. Sagüés, and S. Llorente, “Multi-robot persistent coverage with optimal times,” in Conf. Decision and Control, 2016, pp. 3511–3517.
  27. J. Yu, J. Aslam, S. Karaman, and D. Rus, “Anytime planning of optimal schedules for a mobile sensing robot,” in IEEE/RSJ Int. Conf. Intell. Robots Systems, 2015, pp. 5279–5286.
  28. X. Wang, M. Kloetzer, C. Mahulea, and M. Silva, “Collision avoidance of mobile robots by using initial time delays,” in IEEE Conf. Dec. Control, 2015, pp. 324–329.
  29. M. Turpin, K. Mohta, N. Michael, and V. Kumar, “Goal assignment and trajectory planning for large teams of interchangeable robots,” Autonomous Robots, vol. 37, no. 4, pp. 401–415, 2014.
  30. N. Christofides, “Worst-case analysis of a new heuristic for the travelling salesman problem,” Graduate School of Industrial Administration, Carnegie Mellon University, Tech. Rep., 1976.
  31. C. Prins, P. Lacomme, and C. Prodhon, “Order-first split-second methods for vehicle routing problems: A review,” Transportation Research Part C: Emerging Technologies, vol. 40, pp. 179–200, 2014.
  32. D. Richert and J. Cortes, “Robust distributed linear programming,” IEEE Trans. Autom. Control, vol. 60, no. 10, pp. 2567–2582, 2015.
  33. E. Montijano and A. R. Mosteo, “Efficient multi-robot formations using distributed optimization,” in IEEE Conf. Decision and Control, 2014, pp. 6167–6172.
  34. “IBM-ILOG: CPLEX optimization studio.” [Online]. Available: http://www.ilog.com/products/cplex
Citations (11)
View on Semantic Scholar

Summary

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

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

User Circle Single Streamline Icon: https://streamlinehq.com Sign Up