Abstract
This work considers global path planning enabled by generative adversarial networks (GANs) on a 2D grid world. These networks can learn statistical relationships between obstacles, goals, states, and paths. Given a previously unseen combination of obstacles, goals, and an initial state, they can be asked to guess what a new path would look like. We performed experiments on a 64 × 64 pixel grid that generated a training set by using randomly positioned obstacles and goals. The heuristic search algorithm A* was used to create training paths due to its significant presence in the literature and ease of implementation. We experimented with architectural elements and hyperparameters, converging to a pix2pix-based architecture in which the generator was trained to generate plausible paths given obstacles and two points. A discriminator tried to determine whether these maps were real or fake. Additionally, we defined a qualitative path-generation “success rate” metric derived from the Fréchet inception distance (FID) and optimized our architecture’s parameters, ultimately reaching a 74% success rate on the validation set. Furthermore, we discuss the applicability of this approach to safety-critical settings, concluding that this architecture’s performance and reliability are insufficient to offset the downsides of a black-box approach to path generation.
Reference67 articles.
1. Board, Space Studies, and National Research Council (2011). Vision and Voyages for Planetary Science in the Decade 2013–2022, National Academies Press.
2. The Science Case for Surface Mobility on Icy Worlds;Bull. Am. Astron. Soc.,2021
3. Sánchez-Ibáñez, J.R., Pérez-del-Pulgar, C.J., and García-Cerezo, A. (2021). Path Planning for Autonomous Mobile Robots: A Review. Sensors, 21.
4. A survey on coverage path planning for robotics;Robot. Auton. Syst.,2013
5. Gasparetto, A., Boscariol, P., Lanzutti, A., and Vidoni, R. (2015). Motion and Operation Planning of Robotic Systems, Springer.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献