Collaborative delivery with energy-constrained mobile robots
DOI10.1016/j.tcs.2017.04.018zbMath1437.68034arXiv1608.08500OpenAlexW2518539197MaRDI QIDQ2292912
Andreas Bärtschi, Matúš Mihalák, Yann Disser, Barbara Geissmann, Jérémie Chalopin, Arnaud Labourel, Shantanu Das, Daniel Graf
Publication date: 6 February 2020
Published in: Theoretical Computer Science, Structural Information and Communication Complexity (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.08500
Analysis of algorithms (68W40) Combinatorial optimization (90C27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Agent technology and artificial intelligence (68T42)
Related Items (13)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Convergecast and broadcast by power-aware mobile agents
- Polygon-constrained motion planning problems
- Data delivery by energy-constrained mobile agents
- Piecemeal graph exploration by a mobile robot.
- Collaborative delivery with energy-constrained mobile robots
- Complexity of barrier coverage with relocatable sensors in the plane
- Fast collaborative graph exploration
- Communication Problems for Mobile Agents Exchanging Energy
- Minimizing movement
- Distributed Computing by Mobile Robots: Gathering
- Collective tree exploration
- Collaborative Exploration by Energy-Constrained Mobile Robots
- Planar Formulae and Their Uses
- Matching, Euler tours and the Chinese postman
- Exploring Unknown Undirected Graphs
- Exploring Unknown Environments
- Data Delivery by Energy-Constrained Mobile Agents on a Line
- Why Robots Need Maps
This page was built for publication: Collaborative delivery with energy-constrained mobile robots