Collaborative delivery on a fixed path with homogeneous energy-constrained agents
From MaRDI portal
Publication:5896883
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 6862102 (Why is no real title available?)
- scientific article; zbMATH DE number 6793818 (Why is no real title available?)
- A simplified NP-complete satisfiability problem
- Collaborative Delivery by Energy-Sharing Low-Power Mobile Robots
- Collaborative Exploration by Energy-Constrained Mobile Robots
- Collective fast delivery by energy-efficient agents
- Collective tree exploration
- Communication problems for mobile agents exchanging energy
- Convergecast and broadcast by power-aware mobile agents
- Data delivery by energy-constrained mobile agents
- Data delivery by energy-constrained mobile agents on a line
- Energy-efficient fast delivery by mobile agents
- Fast collaborative graph exploration
- Fibonacci heaps and their uses in improved network optimization algorithms
- Minimizing movement
- Optimal constrained graph exploration
- Piecemeal graph exploration by a mobile robot.
- Polygon-constrained motion planning problems
- Why Robots Need Maps
Cited in
(4)
This page was built for publication: Collaborative delivery on a fixed path with homogeneous energy-constrained agents
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5896883)