The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Time-optimal paths for a Dubins airplane
Abstract
We consider finding a time-optimal trajectory for an airplane from some starting point and orientation to some final point and orientation. Our model extends the Dubins car by L.E. Dubins (1957) to have altitude, which leads toDubinsairplane. We assume that the system has independent bounded control over the altitude velocity as well as the turning rate in the plane. Through the use of the Pontryagin Maximum Principle, we characterize the time-optimal trajectories for the system. They are composed of turns with minimum radius, straight line segments, and pieces of planar elastica. One motivation for determining these elementary pieces is for use as motion primitives in modern planning and control algorithms that consider obstacles.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Mathematical Theory of Optimal Processes.
Blum, E. K., Pontryagin, Boltyanskii, Gamkrelidze, & Mishchenko (1963) · The American Mathematical Monthly · doi:10.2307/2312867 · Cited by 4,261
The Mathematical Theory of Optimal Processes
Bellman, R., Pontryagin, L. S., Boltyanskii, V. G., Gamkrelidze, R. V., Mishchenko, E. F., Trirogoff, K. N., & Neustadt, L. W. (1965) · Econometrica · doi:10.2307/1911909 · Cited by 4,211
Mathematical Theory of Optimal Processes
Pontryagin, L. S. (2018) · Routledge eBooks · doi:10.1201/9780203749319 · Cited by 3,713
Dubins, L. E. (1957) · American Journal of Mathematics · doi:10.2307/2372560 · Cited by 3,045
Optimization—Theory and Applications
Cesari, L. (1983) · Springer eBooks · doi:10.1007/978-1-4613-8165-5 · Cited by 2,559
Optimal paths for a car that goes both forwards and backwards
Reeds, J., & Shepp, L. (1990) · Pacific Journal of Mathematics · doi:10.2140/pjm.1990.145.367 · Cited by 1,447
Conflict resolution for air traffic management: a study in multiagent hybrid systems
Tomlin, C., Pappas, G. J., & Sastry, S. (1998) · IEEE Transactions on Automatic Control · doi:10.1109/9.664154 · Cited by 1,042
Maneuver-based motion planning for nonlinear systems with symmetries
Frazz, E., Dahleh, M. A., & Feron, E. (2005) · IEEE Transactions on Robotics · doi:10.1109/tro.2005.852260 · Cited by 440
Shortest paths synthesis for a car-like robot
Souères, P., & Laumond, J. (1996) · IEEE Transactions on Automatic Control · doi:10.1109/9.489204 · Cited by 254
Shortest paths of bounded curvature in the plane
Boissonnat, J.-D., C�r�zo, A., & Leblond, J. (1994) · Journal of Intelligent & Robotic Systems · doi:10.1007/bf01258291 · Cited by 235
Planning Smooth Paths for Mobile Robots
Jacobs, P., & Canny, J. (1993) · Nonholonomic Motion Planning · doi:10.1007/978-1-4615-3176-0_8 · Cited by 220
Using Motion Primitives in Probabilistic Sample-Based Planning for Humanoid Robots
Hauser, K. K., Bretl, T. W., Harada, K., & Latombe, J. (2008) · Springer tracts in advanced robotics · doi:10.1007/978-3-540-68405-3_32 · Cited by 148
Planning smooth paths for mobile robots
Jacobs, P., & Canny, J. (2003) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.1989.99959 · Cited by 105
Obstacle distance for car-like robots
Vendittelli, M., Laumond, J., & Nissoux, C. (1999) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.781973 · Cited by 88
Conner, D. C., Kress‐Gazit, H., Choset, H., Rizzi, A. A., & Pappas, G. J. (2007) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2007.4399374 · Cited by 78
A fast path planner for a car-like indoor mobile robot
Latombe, J. (1991) · National Conference on Artificial Intelligence · Cited by 61
Boissonnat, J., & Lazard, S. (1996) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/237218.237393 · Cited by 39
Cited by
A survey on path planning for persistent autonomy of autonomous underwater vehicles
Zeng, Z., Lian, L., Sammut, K., He, F., Tang, Y., & Lammas, A. (2015) · Ocean Engineering · doi:10.1016/j.oceaneng.2015.10.007 · Cited by 256
Two invariants of human-swarm interaction
Brown, D. S., Goodrich, M. A., Jung, S.-Y., & Kerman, S. C. (2015) · Journal of Human-Robot Interaction · doi:10.5898/jhri.5.1.brown · Cited by 38
Metadata
- Authors
- Chitsaz, H., & LaValle, S. M.
- Venue
- 2007 46th IEEE Conference on Decision and Control
- Publisher
- IEEE
- Published
- 2007
- Pages
- 2379-2384
- ISSN
- 0191-2216 (ISSN-L)
- OpenAlex
- W2166500251
- Cited by
- 259
- References
- 17
- FWCI
- 8.21
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.