# Tag Info

### Motion Planning vs. Control

There is a saying in software engineering which states that your company structure is reflected in your software architecture (I cannot recall the exact phrase). This is true for a robot control ...
• 6,557
Accepted

### Configuration space of rotating link

Since the configuration space is the set of all possible configurations the link can have, i.e. all possible angles from 0° to 360°, shouldn't the c-space be a line rather than a circle? You are ...
• 1,809

### A* search results in path too close to obstacles

Obstacle padding/ robot padding. Suppose you are working in a 2D environment and that you have an obstacle of the size 2x2. When doing planning (graph search, etc.), you increase the size of the ...
• 1,809
Accepted

### Why in trajectory planning in joint space the manipulator never crosses a singularity?

The term "singularity" characterizes those configurations in the joint space where the Jacobian matrix loses rank and thus it is not directly invertible. The Jacobian, in turn, is used to remap a ...
• 3,810

### How can we solve the problem of robot size in sensor based motion planning?

If you are able to sense obstacles with a sensor pattern that is circular (eg laser scanner, contact sensors on a circular body, etc), and you can rotate the robot pose without translation, then you ...
• 4,315
Accepted

### Motion planning from a given path

Many articles reference algorithms such as A*, PRM or RRT based planners to motion planning algorithms which seems unreasonable since it is still necessary to parametrize found path with time.I wonder,...
• 1,809
Accepted

### Solving a grid maze with blocked paths

You didn't specify any performance requirement. That admits the simple algorithm: ...
• 1,236

### Understanding MoveIt! and OMPL more deeply

Actually I wish to implement my own algorithm (like some variation of RRT) without MoveIt!/OMPL hence it is important for me to know all the details. I am really confused about this. Any ...

### Generate a coverage path given a polygon region

This thing is generally called coverage path planning. If you are particularly interested in Boustrophedon Cell Decomposition, you may have a look at the paper introducing it: Choset and Pignon (1998)...
• 1,809

### Optimal-Time Trajectory Planning in 1D

Hi usually the time optimal solution of a motion not having specific constraints is know as 'bang-bang'. Where you let you system accelerate and decelerate at the maximum rate possible. In your case, ...
• 1,337
Accepted

### Is MoveIt! suitable for fixed-wing aircraft path planning and obstacle avoidance?

Not really MoveIt! is designed for robotic arms, and is being heavily adapted for the applications you see here, fixed wing aircraft typically use very diffrent types of motion planning becouse of the ...
• 1,909

### A* search results in path too close to obstacles

Most planning algorithms reduce your robot to a point and plan a path for that point. The arising problem is exaclty what you are facing. As suggested before, obstacle padding is one of the methods, ...
• 6,557