Dubins Path With Terminal Range and Field-of-View Constraints

This paper addresses a path planning problem for a turn-constrained vehicle equipped with a sensor that has a limited range and field of view (FOV). The vehicle is modeled using Dubins kinematics, and the objective is to determine the shortest path to point where that the target is detectable, i.e., within the sensor’s range and FOV. The limited sensor range imposes a constraint requiring the vehicle to reach a circle centered at the target’s position, with a radius equal to the sensor range. The field-of-view constraints are expressed as coupled conditions on the terminal position and heading. Pontryagin’s minimum principle restricts the optimal path to straight lines and arcs of minimum turn radius. Further analysis shows that the paths are limited to at most two segments. Straight-line segments occur exclusively when the final position lies on the boundary of the target circle. Furthermore, we present an analytical approach for computing optimal paths in scenarios where the optimality conditions result in complex geometric configurations.

Authors

Institutions

Publication Details

Journal
IEEE Control Systems Letters
Published
2025-01-01
DOI
https://doi.org/10.1109/lcsys.2025.3582622
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Dubins Path With Terminal Range and Field-of-View Constraints

Isaac E. Weintraub, David W. Casbeer, Alexander Von Moll, Satyanarayana G. Manyam
IEEE Control Systems Letters
Robotic Path Planning Algorithms
article

Dubins Path With Terminal Range and Field-of-View Constraints

Isaac E. Weintraub, David W. Casbeer, Alexander Von Moll, Satyanarayana G. Manyam
article en

Abstract

This paper addresses a path planning problem for a turn-constrained vehicle equipped with a sensor that has a limited range and field of view (FOV). The vehicle is modeled using Dubins kinematics, and the objective is to determine the shortest path to point where that the target is detectable, i.e., within the sensor’s range and FOV. The limited sensor range imposes a constraint requiring the vehicle to reach a circle centered at the target’s position, with a radius equal to the sensor range. The field-of-view constraints are expressed as coupled conditions on the terminal position and heading. Pontryagin’s minimum principle restricts the optimal path to straight lines and arcs of minimum turn radius. Further analysis shows that the paths are limited to at most two segments. Straight-line segments occur exclusively when the final position lies on the boundary of the target circle. Furthermore, we present an analytical approach for computing optimal paths in scenarios where the optimality conditions result in complex geometric configurations.

IEEE Control Systems LettersVol. 9
United States Air Force Research Laboratory (US), Wright-Patterson Air Force Base (US), United States Air Force (US), DCS Corporation (United States) (US)
Climate action
Openalex Percentile: Top 87%
Robotic Path Planning Algorithms
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.

Dubins Path With Terminal Range and Field-of-View Constraints — Isaac E. Weintraub, David W. Casbeer, et al. · IEEE Control Systems Letters (2025) | TGRS Research Map | TGRS