Polygon-constrained motion planning problems

DOI10.1007/978-3-642-45346-5_6MaRDI QIDQ1796426zbMATH OpenOpenAlexFDO

Authors D. Bilò, Y. Disser, Luciano Gualà, Matúš Mihalák, Guido Proietti, Peter Widmayer

Publication date 17 October 2018

Full work available at URL https://doi.org/10.1007/978-3-642-45346-5_6

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Exact and approximate algorithms for movement problems on (special classes of) graphs
• \(O(1)\)-approximations for maximum movement problems
• Exact and approximate algorithms for movement problems on (special classes of) graphs
• Minimizing movement
• Graphbots: mobility in discrete spaces

Cited in

(10)

• An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space
• On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
• On the Complexity of Universality for Partially Ordered NFAs
• Collaborative delivery on a fixed path with homogeneous energy-constrained agents
• Near-gathering of energy-constrained mobile agents
• Exact and approximate algorithms for movement problems on (special classes of) graphs
• New approximation algorithms for the heterogeneous weighted delivery problem
• New approximation algorithms for the heterogeneous weighted delivery problem
• Collaborative Delivery by Energy-Sharing Low-Power Mobile Robots
• Kinematics and dynamics motion planning by polar piecewise interpolation and geometric considerations

This page was built for publication: Polygon-constrained motion planning problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1796426)