FPS: Fast Path Planner Algorithm Based on Sparse Visibility Graph and Bidirectional Breadth-First Search
Published 2022 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
FPS: Fast Path Planner Algorithm Based on Sparse Visibility Graph and Bidirectional Breadth-First Search
Authors
Keywords
-
Journal
Remote Sensing
Volume 14, Issue 15, Pages 3720
Publisher
MDPI AG
Online
2022-08-04
DOI
10.3390/rs14153720
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- The Application of an Adaptive Genetic Algorithm Based on Collision Detection in Path Planning of Mobile Robots
- (2021) Kun Hao et al. Computational Intelligence and Neuroscience
- Collision-free path planning for a guava-harvesting robot based on recurrent deep reinforcement learning
- (2021) Guichao Lin et al. COMPUTERS AND ELECTRONICS IN AGRICULTURE
- A new hybrid algorithm for path planning of mobile robot
- (2021) Ting-Wei Zhang et al. JOURNAL OF SUPERCOMPUTING
- Development of path planning algorithm for biped robot using combined multi-point RRT and visibility graph
- (2021) Sarthak Pradhan et al. International Journal of Information Technology (Singapore)
- VIRAL-Fusion: A Visual-Inertial-Ranging-Lidar Sensor Fusion Approach
- (2021) Thien-Minh Nguyen et al. IEEE Transactions on Robotics
- A Novel Exploration-Exploitation-Based Adaptive Law for Intelligent Model-Free Control Approaches
- (2021) Onder Tutsoy et al. IEEE Transactions on Cybernetics
- A Review of Visual-LiDAR Fusion based Simultaneous Localization and Mapping
- (2020) César Debeunne et al. SENSORS
- Long-voyage route planning method based on multi-scale visibility graph for autonomous ships
- (2020) Gongxing Wu et al. OCEAN ENGINEERING
- Attention-SLAM: A Visual Monocular SLAM Learning From Human Gaze
- (2020) Jinquan Li et al. IEEE SENSORS JOURNAL
- P3-LOAM: PPP/LiDAR Loosely Coupled SLAM With Accurate Covariance Estimation and Robust RAIM in Urban Canyon Environment
- (2020) Tao Li et al. IEEE SENSORS JOURNAL
- Navigation in Unknown Dynamic Environments Based on Deep Reinforcement Learning
- (2019) Junjie Zeng et al. SENSORS
- Computational complexity aspects of point visibility graphs
- (2018) Anne-Sophie Himmel et al. DISCRETE APPLIED MATHEMATICS
- VINS-Mono: A Robust and Versatile Monocular Visual-Inertial State Estimator
- (2018) Tong Qin et al. IEEE Transactions on Robotics
- A Fast Global Flight Path Planning Algorithm Based on Space Circumscription and Sparse Visibility Graph for Unmanned Aerial Vehicle
- (2018) Abdul Majeed et al. Electronics
- ORB-SLAM2: An Open-Source SLAM System for Monocular, Stereo, and RGB-D Cameras
- (2017) Raul Mur-Artal et al. IEEE Transactions on Robotics
- Reinforcement learning analysis for a minimum time balance problem
- (2016) Onder Tutsoy et al. TRANSACTIONS OF THE INSTITUTE OF MEASUREMENT AND CONTROL
- ORB-SLAM: A Versatile and Accurate Monocular SLAM System
- (2015) Raul Mur-Artal et al. IEEE Transactions on Robotics
- Multivehicle Cooperative Local Mapping: A Methodology Based on Occupancy Grid Map Merging
- (2014) Hao Li et al. IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS
- Occupancy Grid Mapping in Urban Environments from a Moving On-Board Stereo-Vision System
- (2014) You Li et al. SENSORS
- Generation and use of sparse navigation graphs for microscopic pedestrian simulation models
- (2012) Angelika Kneidl et al. ADVANCED ENGINEERING INFORMATICS
- Efficient grid-based spatial representations for robot navigation in dynamic environments
- (2012) Boris Lau et al. ROBOTICS AND AUTONOMOUS SYSTEMS
- Sampling-based algorithms for optimal motion planning
- (2011) Sertac Karaman et al. INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH
- A Tutorial on Graph-Based SLAM
- (2011) G Grisetti et al. IEEE Intelligent Transportation Systems Magazine
Discover Peeref hubs
Discuss science. Find collaborators. Network.
Join a conversationPublish scientific posters with Peeref
Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.
Learn More