In this paper, we propose a new motion planning method that aims to robustly and computationally efficiently solve path planning and navigation problems for unmanned surface vehicles (USVs). Our approach is based on synthesizing two different existing methodologies: sequential composition of dynamic behaviours and rapidly exploring random trees (RRT). The main motivation of this integrated solution is to develop a robust feedback-based and yet computationally feasible motion planning algorithm for USVs. In order to illustrate the main approach and show the feasibility of the method, we performed simulations and tested the overall performance and applicability for future experimental applications. We also tested the robustness of the method under relatively extreme environmental uncertainty. Simulation results indicate that our method can produce robust and computationally feasible solutions for a broad class of USVs.
ArslanOSaranliU (2012) Reactive planning and control of planar spring–mass running on rough terrain. IEEE Transactions on Robotics28(3): 567–579.
2.
BrooksRALozano-PerezT (1985) A subdivision algorithm in configuration space for findpath with rotation. IEEE Transactions on Systems, Man, and Cybernetics2: 224–233.
3.
BrunnerMBrüggemannBSchulzD (2013) Hierarchical rough terrain motion planning using an optimal sampling-based method. In: 2013 IEEE International Conference on Robotics and Automation (ICRA). IEEE, pp. 5539–5544.
4.
BurridgeRRRizziAAKoditschekDE (1999) Sequential composition of dynamically dexterous robot behaviors. The International Journal of Robotics Research18(6): 534–555.
5.
CannyJF (1988) The Complexity of Robot Motion Planning. Cambridge, MA: MIT Press.
6.
ConnerDCChosetHRizziAA (2009) Flow-through policies for hybrid controller synthesis applied to fully actuated systems. IEEE Transactions on Robotics25(1): 136–146.
7.
GreggRDBretlTSpongMW (2010) Asymptotically stable gait primitives for planning dynamic bipedal locomotion in three dimensions. In: 2010 IEEE International Conference on Robotics and Automation (ICRA). IEEE, pp. 1695–1702.
8.
KaramanSFrazzoliE (2010) Incremental sampling-based algorithms for optimal motion planning. In: Robotics Science and Systems VI, p. 104.
9.
KavrakiLLatombeJC (1994) Randomized preprocessing of configuration for fast path planning. In: Proceedings 1994 IEEE International Conference on Robotics and Automation, 1994. IEEE, pp. 2138–2145.
10.
KavrakiLESvestkaPLatombeJCOvermarsMH (1996) Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Transactions on Robotics and Automation12(4): 566–580.
11.
KhatibO (1986) Real-time obstacle avoidance for manipulators and mobile robots. In: Autonomous Robot Vehicles. New York: Springer, pp. 396–404.
12.
KoditschekDE (1992) Task encoding: Toward a scientific paradigm for robot planning and control. Robotics and autonomous systems9(1–2): 5–39.
13.
KorenYBorensteinJ (1991) Potential field methods and their inherent limitations for mobile robot navigation. In: Proceedings 1991 IEEE International Conference on Robotics and Automation, 1991. IEEE, pp. 1398–1404.
14.
KuwataYTeoJKaramanSFioreGFrazzoliEHowJ (2008) Motion planning in complex environments using closed-loop prediction. In: AIAA Guidance, Navigation and Control Conference and Exhibit, p. 7166.
15.
LaValleSMKuffnerJJ (2001) Randomized kinodynamic planning. The International Journal of Robotics Research20(5): 378–400.
16.
LiaoYPangYWanL (2010) Combined speed and yaw control of underactuated unmanned surface vehicles. In: 2010 2nd International Asia Conference on Informatics in Control, Automation and Robotics (CAR), Vol. 1. IEEE, pp. 157–161.
17.
LudersBDKaramanSFrazzoliEHowJP (2010) Bounds on tracking error using closed-loop rapidly-exploring random trees. In: American Control Conference (ACC), 2010. IEEE, pp. 5406–5412.
18.
MasonM (1985) The mechanics of manipulation. In: Proceedings 1985 IEEE International Conference on Robotics and Automation, Vol. 2. IEEE, pp. 544–548.
19.
MooreJCoryRTedrakeR (2014) Robust post-stall perching with a simple fixed-wing glider using LQR-trees. Bioinspiration and Biomimetics9(2): 025013.
20.
RanganathanAKoenigS (2004) Pdrrts: Integrating graph-based and cell-based planning. In: Proceedings 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2004 (IROS 2004), Vol. 3. IEEE, pp. 2799–2806.
21.
ReifJH (1979) Complexity of the mover’s problem and generalizations. In: Proceedings of the 20th Annual Symposium on Foundations of Computer Science (SFCS ’79). Washington, DC: IEEE Computer Society Press, pp. 421–427.
22.
ReistPPreiswerkPTedrakeR (2016) Feedback-motion-planning with simulation-based LQR-trees. The International Journal of Robotics Research35(11): 1393–1416.
23.
RimonEKoditschekDE (1992) Exact robot navigation using artificial potential functions. IEEE Transactions on robotics and automation8(5): 501–518.
24.
RizziAAGowdyJHollisRL (2001) Distributed coordination in modular precision assembly systems. The International Journal of Robotics Research20(10): 819–838.
25.
TedrakeR (2009) LQR-trees: Feedback motion planning on sparse randomized trees. In: Robotics: Science and Systems V, University of Washington, Seattle, WA, 28 June–1 July 2009.
26.
TedrakeRManchesterIRTobenkinMRobertsJW (2010) LQR-trees: Feedback motion planning via sums-of-squares verification. The International Journal of Robotics Research29(8): 1038–1052.
27.
WuGSunHZouJWanL (2009) The basic motion control strategy for the water-jet-propelled USV. In: International Conference on Mechatronics and Automation, 2009 (ICMA 2009). IEEE, pp. 611–616.
28.
YangLLavalleSM (2004) The sampling-based neighborhood graph: An approach to computing and executing feedback motion strategies. IEEE Transactions on Robotics and Automation20(3): 419–432.
