Distributed boundary coverage with a team of networked miniature robots using a robust market-based algorithm
From MaRDI portal
Publication:1022474
DOI10.1007/s10472-009-9127-8zbMath1185.68727OpenAlexW2157559538MaRDI QIDQ1022474
Alcherio Martinoli, Nikolaus Correll, Patrick Amstutz
Publication date: 22 June 2009
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/49445
Discrete event control/observation systems (93C65) Reasoning under uncertainty in the context of artificial intelligence (68T37) Artificial intelligence for robotics (68T40) Distributed algorithms (68W15)
Related Items
Uses Software
Cites Work
- Min-max tree covers of graphs.
- Distributed boundary coverage with a team of networked miniature robots using a robust market-based algorithm
- Not all insertion methods yield constant approximate tours in the Euclidean plane
- Spanning-tree based coverage of continuous areas by a mobile robot
- Modeling and Optimization of a Swarm-Intelligent Inspection System