Questions tagged [motion-planning]

Motion planning is the task of finding a continuous, collision free, path for an robot (entity) through a workspace that may contains obstacle, or reporting that no such path exists.

Resources for Learning More

In his response to a now-deleted Stack Overflow question, Andrew Walker writes:

The most comprehensive text I know of in this area is Steven LaValle's "Planning Algorithms", which is available from http://planning.cs.uiuc.edu/, as HTML and a PDF. Also included on the books webpage is a BibTeX file with more than a thousand references to the most significant literature in the field.

If you're looking for something a little more gentle, but no less comprehensive, you can check out the MIT Press book "Principle of Robot Motion Planning" by Choset, Lynch, Hutchinson, Kantor, Burgard, Kavraki and Thrun. Also of interest in robotics / sensing / motion planning is the excellent "Probabilistic Robotics" by Thrun, Burgard and Fox.

The classic text is "Robot Motion Planning" by Latombe, that has great coverage of the complete motion planning algorithms.

If you were looking for one place to start, I would have to recommend James Bruce's work on robocup and planning for autonomous systems, in particular his thesis "Real-Time Motion Planning and Safe Navigation in Dynamic Multi-Robot Environments" and the paper "Real-Time Randomized Path Planning for Robot Navigation". The work is presented in a way that makes it very approachable.

60 questions
0
votes
0 answers

How to implement and coding the b_spline function to create blend path?

I want to create a path that traverses three specific points. My goal is to cross the midpoint as a curve(blend path), I used b_splinepolytraj in MATLAB function and it works. but I want to coding and implementing b_spline without using prepare…
Hadis
  • 13
  • 6
0
votes
0 answers

Finding shortest path in presence of hidden obstacles

I want to find the solution to the problem shown I am new to motion planning and also dont know much about graph based search algorithms. Here the "red" obstacles are not already known. Without red obstacles, i can find shortest path using BFS. Now…
0
votes
1 answer

Path Planning on a 3d point cloud

I have a 3d point cloud of a location on which I am trying to design a path planner for a mobile robot. Can anyone please guide me towards the right approach to take in solving the problem. For the point cloud, I have the coordinates of the…
0
votes
0 answers

Is a grid-approximation with A*-Search of a continuous motion planning problem resolution-optimal?

Given a continuous motion planning problem of finding a collision-free path from A to B, the A* search is known to be optimal on a finite sized grid-approximation, where each grid-cell for example has 4 or 8 neighbours. Now, the A* path might be…
0
votes
1 answer

Is there an easy way to find out which of two frames is closer to the root in a Multibody plant?

I am working on recovering from collision. I have the names of bodies in collision and the frames associated with them and now I want to move the body/frame that is closer to the end effector to get out of collision, but I couldn't find a…
Gavin
  • 91
  • 1
  • 9
0
votes
1 answer

How to find occupancy of bounding box in a grid?

occupancy grid Hi,i have a 4 point bounding box and a grid (x,y,resolution). How can I determine which cells will this bounding box occupy as seen in the above image?
0
votes
1 answer

How to change 'cost' of path here?

I'm reading this python code about A star algorithm. For me, I understand how this algorithm work, but when I come to the code I got some confusing things until to understand. I want to be able to change the cost of paths here. I mean I need to be…
0
votes
1 answer

I had this error while writing a code on motion planning. How to get rif of it?

import time, timeit, random, pygame, sys from math import * import numpy as np XDIM = 1000 #window length YDIM = 1200 #window breadth WINSIZE = [XDIM, YDIM] EPSILON = 7.0 #threshold NUMNODES = 10000 GOAL_RADIUS = 10 MIN_DISTANCE_TO_ADD = 1.0…
user10840182
0
votes
1 answer

How does A* search select the next node, when nodes with the same heauristic value get added?

I have a basic understanding of the concept but a model answer given by a lecturer confused me, I'm confused over the fact how (2,3)B node is expanded ahead of (2,3)A node which in theory gets added to the queue first(Before node B is added) This…
0
votes
0 answers

How could I modify the formula of A star algorithm to what I need below?

I'm working on A star algorithm. I'm trying to build a trajectory for drone depending on A star. I have implemented my code below. I need to consider the height of obstacles and modify my equation : F= G+H to F=H+G+E E: represents the elevation of…
user11791503
0
votes
0 answers

What does (pind) imply here?

I'm reading this python code about A star algorithm. For me, I understand how this algorithm work, but when I come to the code I got some confusing things until to understand. According to this below code snippet, I mean the class Node, what does…
user11319990
0
votes
1 answer

How did we give these values of the eight directions in A star algorithm?

I'm trying to implement my own code based on this code. While i'm reading this code, I got confused here about this part. The part of the below function: def get_motion_model(): # dx, dy, cost motion = [[1, 0, 1], [0, 1, 1], …
0
votes
2 answers

Robot reverses at high speed before following path given by ros nav stack

I am using ros nav stack in conjunction with google cartographer (Mapping and localization) to navigate the robot through a known map. Right now, the robot follows the path generated with acceptable accuracy. But,often, once the path has been…
0
votes
1 answer

What happens when RRT is used for a configuration space with no solution?

What happens when RRT or its variants (e.g. RRT-connect) is used for a configuration space with no solution? (for example, when none of the existing paths is free of collision) Does it just loop forever?
TTT
  • 11
  • 2
0
votes
0 answers

Local minima in a Moore neighborhood

While trying to use a wavefront algorithm, I came across a scenario that I haven’t been able to easily solve. I populate an array with a wavefront algorithm and using a Moore neighborhood, how do I decide which way to travel given that several of…