Journal Article10.1016/J.ROBOT.2014.03.002
Concurrent dynamic programming for grid-based problems and its application for real-time path planning
Stephen Cossell,Jose Guivant +1 more
16
TL;DR: The proposed approach provides mathematically identical results to traditional grid-based motion planning solvers in at least an order of magnitude less time by leveraging the concurrent architecture found in modern graphics hardware.
read more
About: This article is published in Robotics and Autonomous Systems. The article was published on 01 Jun 2014. The article focuses on the topics: Motion planning & Dynamic programming.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Grid-Based Mobile Robot Path Planning Using Aging-Based Ant Colony Optimization Algorithm in Static and Dynamic Environments.
Fatin Hassan Ajeil,Ibraheem Kasim Ibraheem,Ahmad Taher Azar,Ahmad Taher Azar,Amjad J. Humaidi +4 more
TL;DR: Simulations showed that the proposed path planning algorithms result in superior performance by finding the shortest and the most free-collision path under various static and dynamic scenarios.
178
Topology optimization techniques for mobile robot path planning
Baotong Li,Honglei Liu,Su Wenjun +2 more
TL;DR: An explicit growth-based topology optimizer to generate optimal paths for a point robot moving in complex environments filled with obstacles is proposed and is practically attractive to various path planning problems.
45
Path planning using a Multiclass Support Vector Machine
Nestor Morales,Jonay Toledo,Leopoldo Acosta +2 more
- 01 Jun 2016
TL;DR: A new path planning algorithm for unstructured environments based on a Multiclass Support Vector Machine (MSVM) is presented, which takes advantage of the training stage of a MSVM to obtain the set of paths that maximize the distance to the obstacles while minimizing the effect of measurement errors.
27
2D multi-area coverage path planning using L-SHADE in simulated ocean survey
TL;DR: A new path planning method based on Successful History-Based Adaptive Differential Evolution variants with Linear population size reduction with L-SHADE that is able to improve the efficiency and stability of multi-area coverage path planning.
17
Heuristic approaches in robot navigation
Neerendra Kumar,Zoltan Vamossy,Zsolt Miklos Szabo-Resch +2 more
- 01 Jun 2016
TL;DR: The implementation of A* algorithm as a global path planner for the navigation of a Turtlebot robot and a map of the navigation environment has been developed for a Gazebo simulator's world.
9
References
A note on two problems in connexion with graphs
TL;DR: A tree is a graph with one and only one path between every two nodes, where at least one path exists between any two nodes and the length of each branch is given.
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
TL;DR: How heuristic information from the problem domain can be incorporated into a formal mathematical theory of graph searching is described and an optimality property of a class of search strategies is demonstrated.
12.7K
Using occupancy grids for mobile robot perception and navigation
TL;DR: An approach to robot perception and world modeling that uses a probabilistic tesselated representation of spatial information called the occupancy grid, a multidimensional random field that maintains stochastic estimates of the occupancy state of the cells in a spatial lattice is reviewed.
2.5K
Moore's law: past, present and future
TL;DR: Moore's Law has become the central driving force of one of the most dynamic of the world's industries as discussed by the authors, and it is viewed as a reliable method of calculating future trends as well, setting the pace of innovation, and defining the rules and the very nature of competition.
1.9K
A randomized roadmap method for path and manipulation planning
Nancy M. Amato,Y. Wu +1 more
- 22 Apr 1996
TL;DR: A new randomized roadmap method for motion planning for many DOF robots that can be used to obtain high quality roadmaps even when C-space is crowded, with the main novelty in the authors' approach is that roadmap candidate points are chosen on C-obstacle surfaces.
442