More Like this

1. Optimal Path-Planning With Random Breakdowns

   https://doi.org/10.1109/LCSYS.2021.3130193  

   Gee, Marissa; Vladimirsky, Alexander (January 2022, IEEE Control Systems Letters)
2. Optimal GPS Integrity-Constrained Path Planning for Ground Vehicles

   https://doi.org/10.1109/PLANS46316.2020.9109898  

   Maaref, Mahdi; Kassas, Zaher M. (April 2020, IEEE/ION Position, Location and Navigation Symposium)

   null (Ed.)
3. Near-optimal Smooth Path Planning for Multisection Continuum Arms

   https://doi.org/10.1109/ROBOSOFT.2019.8722778  

   Deng, Jiahao; Meng, Brandon H.; Kanj, Iyad; Godage, Isuru S. (April 2019, 2019 2nd IEEE International Conference on Soft Robotics (RoboSoft))

   We study the path planning problem for continuum-arm robots, in which we are given a starting and an end point, and we need to compute a path for the tip of the continuum arm between the two points. We consider both cases where obstacles are present and where they are not. We demonstrate how to leverage the continuum arm features to introduce a new model that enables a path planning approach based on the configurations graph, for a continuum arm consisting of three sections, each consisting of three muscle actuators. The algorithm we apply to the configurations graph allows us to exploit parallelism in the computation to obtain efficient implementation. We conducted extensive tests, and the obtained results show the completeness of the proposed algorithm under the considered discretizations, in both cases where obstacles are present and where they are not. We compared our approach to the standard inverse kinematics approach. While the inverse kinematics approach is much faster when successful, our algorithm always succeeds in finding a path or reporting that no path exists, compared to a roughly 70% success rate of the inverse kinematics approach (when a path exists). 

   more » « less
4. Refined hardness of distance-optimal multi-agent path finding

   Tzvika Geft, Dan Halperin (April 2022, International Conference on Autonomous Agents and Multi-agent Systems)
5. Path Planning for Optimal Coverage of Areas with Nonuniform Importance

   https://doi.org/10.2514/6.2022-2546  

   Snyder, Gregory A.; Shriwastav, Sachin; Morrison, Dylan; Song, Zhuoyuan (January 2022, AIAA SCITECH 2022 Forum)

   Coverage of an inaccessible or challenging region with potential health and safety hazards, such as in a volcanic region, is difficult yet crucial from scientific and meteorological perspectives. Areas contained within the region often provide valuable information of varying importance. We present an algorithm to optimally cover a volcanic region in Hawai`i with an unmanned aerial vehicle (UAV). The target region is assigned with a nonuniform coverage importance score distribution. For a specified battery capacity of the UAV, the optimization problem seeks the path that maximizes the total coverage area and the accumulated importance score while penalizing the revisiting of the same area. Trajectories are generated offline for the UAV based on the available power and coverage information map. The optimal trajectory minimizes the unspent battery power while enforcing that the UAV returns to its starting location. This multi-objective optimization problem is solved by using sequential quadratic programming. The details of the competitive optimization problem are discussed along with the analysis and simulation results to demonstrate the applicability of the proposed algorithm. 

   more » « less