CNN Encoder to Reduce the Dimensionality of Data Image for Motion Planning

• URL: http://arxiv.org/abs/2004.05077v1
• Date: Fri, 10 Apr 2020 15:44:52 GMT
• Title: CNN Encoder to Reduce the Dimensionality of Data Image for Motion Planning
• Authors: Janderson Ferreira (1), Agostinho A. F. J\'unior (1), Yves M. Galv\~ao (1), Bruno J. T. Fernandes (1) and Pablo Barros (1 and 2) ((1) Universidade de Pernambuco - Escola Polit\'ecnica de Pernambuco, (2) Cognitive Architecture for Collaborative Technologies Unit - Istituto Italiano di Tecnologia)
• Abstract summary: We propose a CNN encoder capable of eliminating useless routes for motion planning problems. In all evaluated scenarios, our solution reduced the number of iterations by more than 60%.
• Score: 1.244705780038575
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Many real-world applications need path planning algorithms to solve tasks in different areas, such as social applications, autonomous cars, and tracking activities. And most importantly motion planning. Although the use of path planning is sufficient in most motion planning scenarios, they represent potential bottlenecks in large environments with dynamic changes. To tackle this problem, the number of possible routes could be reduced to make it easier for path planning algorithms to find the shortest path with less efforts. An traditional algorithm for path planning is the A*, it uses an heuristic to work faster than other solutions. In this work, we propose a CNN encoder capable of eliminating useless routes for motion planning problems, then we combine the proposed neural network output with A*. To measure the efficiency of our solution, we propose a database with different scenarios of motion planning problems. The evaluated metric is the number of the iterations to find the shortest path. The A* was compared with the CNN Encoder (proposal) with A*. In all evaluated scenarios, our solution reduced the number of iterations by more than 60\%.

Related papers

• Neural MP: A Generalist Neural Motion Planner [75.82675575009077]
  We seek to do the same by applying data-driven learning at scale to the problem of motion planning. Our approach builds a large number of complex scenes in simulation, collects expert data from a motion planner, then distills it into a reactive generalist policy. We perform a thorough evaluation of our method on 64 motion planning tasks across four diverse environments.
  arXiv  Detail & Related papers  (2024-09-09T17:59:45Z)
• LLM-A*: Large Language Model Enhanced Incremental Heuristic Search on Path Planning [91.95362946266577]
  Path planning is a fundamental scientific problem in robotics and autonomous navigation. Traditional algorithms like A* and its variants are capable of ensuring path validity but suffer from significant computational and memory inefficiencies as the state space grows. We propose a new LLM based route planning method that synergistically combines the precise pathfinding capabilities of A* with the global reasoning capability of LLMs. This hybrid approach aims to enhance pathfinding efficiency in terms of time and space complexity while maintaining the integrity of path validity, especially in large-scale scenarios.
  arXiv  Detail & Related papers  (2024-06-20T01:24:30Z)
• STAMP: Differentiable Task and Motion Planning via Stein Variational Gradient Descent [35.96763689715956]
  Planning for sequential robotics tasks often requires integrated symbolic and geometric reasoning. TAMP algorithms typically solve these problems by performing a tree search over high-level task sequences while checking for kinematic and dynamic feasibility. We propose a novel approach to TAMP called Stein Task and Motion Planning (STAMP) that relaxes the hybrid optimization problem into a continuous domain.
  arXiv  Detail & Related papers  (2023-10-03T03:53:51Z)
• POA: Passable Obstacles Aware Path-planning Algorithm for Navigation of a Two-wheeled Robot in Highly Cluttered Environments [53.41594627336511]
  Passable Obstacles Aware (POA) planner is a novel navigation method for two-wheeled robots in a cluttered environment. Our algorithm allows two-wheeled robots to find a path through passable obstacles.
  arXiv  Detail & Related papers  (2023-07-16T19:44:27Z)
• Simultaneous Contact-Rich Grasping and Locomotion via Distributed Optimization Enabling Free-Climbing for Multi-Limbed Robots [60.06216976204385]
  We present an efficient motion planning framework for simultaneously solving locomotion, grasping, and contact problems. We demonstrate our proposed framework in the hardware experiments, showing that the multi-limbed robot is able to realize various motions including free-climbing at a slope angle 45deg with a much shorter planning time.
  arXiv  Detail & Related papers  (2022-07-04T13:52:10Z)
• Systematic Comparison of Path Planning Algorithms using PathBench [55.335463666037086]
  Path planning is an essential component of mobile robotics. Development of learning-based path planning algorithms has been experiencing rapid growth. This paper presents PathBench, a platform for developing, visualizing, training, testing, and benchmarking of existing and future path planning algorithms.
  arXiv  Detail & Related papers  (2022-03-07T01:52:57Z)
• Learning to Search in Task and Motion Planning with Streams [20.003445874753233]
  Task and motion planning problems in robotics combine symbolic planning over discrete task variables with motion optimization over continuous state and action variables. We propose a geometrically informed symbolic planner that expands the set of objects and facts in a best-first manner. We apply our algorithm on a 7DOF robotic arm in block-stacking manipulation tasks.
  arXiv  Detail & Related papers  (2021-11-25T15:58:31Z)
• PathBench: A Benchmarking Platform for Classical and Learned Path Planning Algorithms [59.3879573040863]
  Path planning is a key component in mobile robotics. Few attempts have been made to benchmark the algorithms holistically or unify their interface. This paper presents PathBench, a platform for developing, visualizing, training, testing, and benchmarking of existing and future path planning algorithms.
  arXiv  Detail & Related papers  (2021-05-04T21:48:18Z)
• Deep Reinforcement Learning Based Dynamic Route Planning for Minimizing Travel Time [8.234463661266169]
  We design a route planning algorithm based on deep reinforcement learning for pedestrians. We propose a dynamically adjustable route planning (DARP) algorithm, where the agent learns strategies through a dueling deep Q network to avoid congested roads. Simulation results show that the DARP algorithm saves 52% of the time under congestion condition when compared with traditional shortest path planning algorithms.
  arXiv  Detail & Related papers  (2020-11-03T15:10:09Z)
• Performance Improvement of Path Planning algorithms with Deep Learning Encoder Model [1.1995939891389429]
  Convolutional Neural Network (CNN) was used to overcome this situation. This paper analyzes in-depth the performance to eliminate the useless paths using this CNN model.
  arXiv  Detail & Related papers  (2020-08-05T17:34:31Z)
• Three Dimensional Route Planning for Multiple Unmanned Aerial Vehicles using Salp Swarm Algorithm [0.0]
  Route planning is a series of translation and rotational steps from a given start location to the destination goal location. The proposed approach improves the average cost and overall time by 1.25% and 6.035% respectively.
  arXiv  Detail & Related papers  (2019-11-24T12:36:18Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.