Optimal Strategy for Walking in Streets with Minimum Number of Turns for a Simple Robot

DOI10.1007/978-3-319-12691-3_9zbMATH Open1358.68306OpenAlexW2142092599MaRDI QIDQ2942385FDOQ2942385

Mohammad Ghodsi, Azadeh Tabatabaei

Publication date: 11 September 2015

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-12691-3_9

Recommendations

• Optimal on-line algorithms for walking with minimum number of turns in unknown streets
• Path planning and gait of walking machine in an obstacle-strewn environment
• Optimization of motions of a universal multilink walking robot
• Time optimal path planning for a wheeled mobile robot
• Optimal any-angle pathfinding in practice
• Synthesis of optimal program law for movement of a robot with orthogonal walking drives
• An Optimal Competitive Strategy for Walking in Streets

zbMATH Keywords

computational geometrysimple robotminimum link pathunknown environmentstreet polygon

Mathematics Subject Classification ID

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

Cited In (2)

• An Optimal Competitive Strategy for Walking in Streets
• Optimal on-line algorithms for walking with minimum number of turns in unknown streets

This page was built for publication: Optimal Strategy for Walking in Streets with Minimum Number of Turns for a Simple Robot

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