The OMEPP object-pickup energy-routing problem is solved by a concurrent search over payload-constrained path databases, giving near-optimal paths one to two orders of magnitude faster than repeated Z* searches in terrain experiments.
In: Proceedings of the Seventh AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, AIIDE 2011, October 10-14, 2011, Stanford, California, USA, 122-
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.RO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Energy-Efficient Path Planning with Multi-Location Object Pickup for Mobile Robots on Uneven Terrain
The OMEPP object-pickup energy-routing problem is solved by a concurrent search over payload-constrained path databases, giving near-optimal paths one to two orders of magnitude faster than repeated Z* searches in terrain experiments.