# A Non-Smooth Numerical Optimization Approach to the Three-Point Dubins Problem (3 PDP)
## 6 Algorithms
### Pattern Search with Root Finder
* (17) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Exact and Heuristic Multi-Robot Dubins Coverage Path Planning for Known Environments. _Sensors_**2023**, _23_, 2560. [[https://doi.org/10.3390/s23052560](https://doi.org/10.3390/s23052560)]([https://doi.org/10.3390/s23052560](https://doi.org/10.3390/s23052560)). * (18) [PERSON] On the methods of nonsmooth optimization. In _System Modelling and Optimization_; [PERSON] [PERSON]; Berlin/Heidelberg, Germany, 1990; pp. 177-186. * (19) [PERSON]; [PERSON]; [PERSON] _Introduction to Nonsmooth Optimization: Theory, Practice and Software_; Springer: Berlin/Heidelberg, Germany, 2014; Volume 12. * (20) [PERSON]; [PERSON]; [PERSON] _Partitional Clustering via Nonsmooth Optimization_; Springer Nature: Cham, Switzerland, 2020. * (21) [PERSON] _Introduction to Numerical Methods in Differential Equations_; Springer: Berlin/Heidelberg, Germany, 2007. * (22) [PERSON]; [PERSON]; [PERSON] Algorithm 748: Enclosing zeros of continuous functions. _ACM Trans. Math. Softw. (TOMS)_**1995**, _21_, 327-344. [[https://doi.org/10.1145/210089.210111](https://doi.org/10.1145/210089.210111)]([https://doi.org/10.1145/210089.210111](https://doi.org/10.1145/210089.210111)). * (23) [PERSON]; [PERSON]; [PERSON] Clothoids: A C++ library with MATLAB interface for the handling of clothoid curves. _Rend. Del Semin. Mat._**2018**, _76_, 47-56. * (24) [PERSON]; [PERSON] Clothoids: A C++ Library with Matlab Interface. 2019. Available online: [[https://github.com/ebertolazzi/Clothoids](https://github.com/ebertolazzi/Clothoids)]([https://github.com/ebertolazzi/Clothoids](https://github.com/ebertolazzi/Clothoids)) (accessed on 1 June 2024). * (25) [PERSON]; [PERSON]; [PERSON] Bounded-Curvature Shortest Paths through a Sequence of Points. Research Report RR-7465, INRIA, HAL ID:inria-00539957. 2010. Available online: [[https://inria.hal.science/inria-00539957](https://inria.hal.science/inria-00539957)]([https://inria.hal.science/inria-00539957](https://inria.hal.science/inria-00539957)) (accessed on 1 June 2024). * (26) [PERSON]; [PERSON] On efficient computation of shortest Dubins paths through three consecutive points. In Proceedings of the 2016 IEEE 55 th Conference on Decision and Control (CDC), Las Vegas, NV, USA, 12-14 December 2016; pp. 6010-6015. [[https://doi.org/10.1109/CDC.2016.779912](https://doi.org/10.1109/CDC.2016.779912)]([https://doi.org/10.1109/CDC.2016.779912](https://doi.org/10.1109/CDC.2016.779912)). * (27) [PERSON]; [PERSON]; [PERSON] Bounded-Curvature Shortest Paths through a Sequence of Points Using Convex Optimization. _SIAM J. Comput._**2013**, _42_, 662-684. [[https://doi.org/10.1137/100816079](https://doi.org/10.1137/100816079)]([https://doi.org/10.1137/100816079](https://doi.org/10.1137/100816079)). * (28) [PERSON]; [PERSON] [PERSON]; [PERSON] A novel approach for 3 PDP and real-time via point path planning of Dubins' vehicles in marine applications. _Control Eng. Pract._**2024**, _144_, 105814. [[https://doi.org/10.1016/j.conengprac.2023.105814](https://doi.org/10.1016/j.conengprac.2023.105814)]([https://doi.org/10.1016/j.conengprac.2023.105814](https://doi.org/10.1016/j.conengprac.2023.105814)). * (29) [PERSON]; [PERSON] Relaxed Dubins problems through three points. In Proceedings of the 2019 27 th Mediterranean Conference on Control and Automation (MED), Akko, Israel, 1-4 July 2019; pp. 501-506. * (30) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Discretization-based and look-ahead algorithms for the dubins traveling salesperson problem. _IEEE Trans. Autom. Sci. Eng._**2016**, _14_, 383-390. * (31) [PERSON]; [PERSON] Shortest Dubins paths through three points. _Automatica_**2019**, _105_, 368-375. [[https://doi.org/10.1016/j.automatica.2019.04.007](https://doi.org/10.1016/j.automatica.2019.04.007)]([https://doi.org/10.1016/j.automatica.2019.04.007](https://doi.org/10.1016/j.automatica.2019.04.007)). * (32) [PERSON]; [PERSON] A Note on Robust Biarc Computation. _Comput.-Aided Des. Appl._**2019**, _16_, 822-835.