Energy optimal path planning for wheeled mobile robots with circular obstacle

Abstract The energy optimal motion planning algorithm for a differential drive robot with a circular obstacle in the maneuver space is introduced in this article. Rather than the traditional unicycle model, a non‐canonical state space model of the kinematics of a wheeled mobile robot is used to formulate the optimal control problem. The necessary conditions for optimality are formally derived using calculus of variations, resulting in constraints for the costates when the inequality constraint become active, revealing that the controls are required to be continuous. The optimality conditions permit decomposing the motion planning problem in two independent segments: prior to and after activation of the inequality constraints. Analytical expressions for the evolving states and control are found to be a function of Jacobi elliptic functions, permitting reducing the optimal control problem to a root‐finding problem. A comprehensive parametric study is included to demonstrate the impact on the optimal trajectories by varying the radius of the obstacle. The study shows that there are three distinct maneuver strategies with respect to the size of the obstacle. Furthermore, by including entering and exit time as optimization variables, a methodology for generalizing the development to any given motion scenario is developed and numerically illustrated.

Authors

Institutions

Publication Details

Journal
Optimal Control Applications and Methods
Published
2024-10-07
DOI
https://doi.org/10.1002/oca.3208
Citations
3
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.75
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Energy optimal path planning for wheeled mobile robots with circular obstacle

Tarunraj Singh, Youngjin Kim
3 citations
Optimal Control Applications and Methods
Robotic Path Planning Algorithms
0.75
article

Energy optimal path planning for wheeled mobile robots with circular obstacle

Tarunraj Singh, Youngjin Kim
article en
3 citations

Abstract

Abstract The energy optimal motion planning algorithm for a differential drive robot with a circular obstacle in the maneuver space is introduced in this article. Rather than the traditional unicycle model, a non‐canonical state space model of the kinematics of a wheeled mobile robot is used to formulate the optimal control problem. The necessary conditions for optimality are formally derived using calculus of variations, resulting in constraints for the costates when the inequality constraint become active, revealing that the controls are required to be continuous. The optimality conditions permit decomposing the motion planning problem in two independent segments: prior to and after activation of the inequality constraints. Analytical expressions for the evolving states and control are found to be a function of Jacobi elliptic functions, permitting reducing the optimal control problem to a root‐finding problem. A comprehensive parametric study is included to demonstrate the impact on the optimal trajectories by varying the radius of the obstacle. The study shows that there are three distinct maneuver strategies with respect to the size of the obstacle. Furthermore, by including entering and exit time as optimization variables, a methodology for generalizing the development to any given motion scenario is developed and numerically illustrated.

Optimal Control Applications and MethodsVol. 46(2)
University at Buffalo, State University of New York (US)
Openalex Percentile: Top 27%
Robotic Path Planning Algorithms
0.75
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.