Spline-Based Robot Navigation

@article{Magid2006SplineBasedRN,
  title={Spline-Based Robot Navigation},
  author={Evgeni Magid and Daniel Keren and Ehud Rivlin and Irad Yavneh},
  journal={2006 IEEE/RSJ International Conference on Intelligent Robots and Systems},
  year={2006},
  pages={2296-2301}
}
  • E. Magid, D. Keren, I. Yavneh
  • Published 1 October 2006
  • Computer Science
  • 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems
This paper offers a path planning algorithm based on splines. The sought path avoids the obstacles, and is smooth and short. Smoothing is used as an integral part of the algorithm, and not only as a final improvement to a path found by other methods. In order to avoid a very difficult optimization over all the path's points, it is modeled by a sequence of splines defined by a gradually increasing number of knots 
View on IEEE
cs.haifa.ac.il
64 Citations
Highly Influential Citations
1
Background Citations
33
Methods Citations
15

Figures from this paper

64 Citations

Continuous-Curvature Bounded Trajectory Planning Using Parametric Splines
TLDR
This paper investigates trajectory generation for curvature continuous paths using a car-like wheeled robot platform and minimize the traversal time while maintaining continuity and obeying the robot's constraints.
Modified Spline-based Path Planning for Autonomous Ground Vehicle
TLDR
A modification of the original spline-based path planning algorithm for a mobile robot navigation is proposed, which succeeds to solve local minima problem and adds additional criteria of start and target points visibility to help optimizing the path selection.
Combining Voronoi Graph and Spline-Based Approaches for a Mobile Robot Path Planning
TLDR
A modification of the original spline-based path planning algorithm for a mobile robot navigation is proposed, which succeeds to solve local minima problem and considers additional criteria of start and target points visibility to help optimizing the path selection.
Voronoi-based trajectory optimization for UGV path planning
TLDR
A path planning algorithm is described, which allows to build a preliminary motion trajectory using global information about environment, and then dynamically adjust the path in real-time by varying objective function weights.
Continuous Path Smoothing for Car-Like Robots Using B-Spline Curves
TLDR
Using presented approach, autonomous vehicles generate and follow paths that humans are accustomed to, with minimum disturbances, and ultimately contribute towards passenger comfort improvement.
A comparative study of smooth path planning for a mobile robot considering kinematic constraints
  • Sinem On, A. Yazıcı
  • Business
    2011 International Symposium on Innovations in Intelligent Systems and Applications
  • 2011
TLDR
In this study, a smooth path planning approach is proposed and compared to path smoothing for an autonomous mobile robot and experiments are conducted to show the effectiveness of the proposed approach.
Path Planning and Following of Omnidirectional Mobile Robot Based on B-spline
TLDR
A path planning method of omnidirectional mobile robot based on Uniform Cubic B-Spline Curves that avoids large-scale matrix calculation, effectively reduces the time complexity and space complexity of the algorithm and has strong operability.
Modified Spline-Based Navigation: Guaranteed Safety for Obstacle Avoidance
TLDR
A modification of the original spline-based path planning algorithm, which consists of two levels of planning, where Voronoi-based approach provides a number sub-optimal paths in different homotopic groups and a new safety criterion is integrated into both levels to guarantee path safety.
Path planning with obstacle avoidance by G1 PH quintic splines
An Analytical Continuous-Curvature Path-Smoothing Algorithm
TLDR
Results show the effectiveness of the analytical algorithm in generating a continuous-Curvature path, which satisfies an upper bound-curvature constraint, and that the path generated requires less control effort to track and minimizes control-input variability.
...
...

References

SHOWING 1-10 OF 19 REFERENCES
A novel approach to smooth trajectory planning of a mobile robot
  • S. Aydin, H. Temeltaş
  • Computer Science
    7th International Workshop on Advanced Motion Control. Proceedings (Cat. No.02TH8623)
  • 2002
TLDR
This paper represents a novel smooth trajectory planning algorithm which uses the natural behavior model of a mobile robot and is applicable to the real time dynamic configuration spaces, because of simplicity and low computational time.
Smooth path planning by using visibility graph-like method
  • T. Kito, J. Ota, T. Nishiyama
  • Engineering
    2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422)
  • 2003
TLDR
A path expression methodology consisting of line segments, circular arcs and clothoid arcs, and a method of global path generation with a visibility graph is proposed.
Continuous smooth path execution for an autonomous guided vehicle (AGV)
A method for converting a series of line segments generated by a high-level path planner for an AGV to a combination of continuous smooth curves and straight line paths is presented. Ideally, the…
Smooth motion planning for car-like vehicles
TLDR
The main idea of the paper is to consider the car as a 4-D system from a kinematic point of view and as a 3-D systems from a geometric points of view of collision checking and the resulting planned motions are guaranteed to be collision-free.
Primitives for smoothing mobile robot trajectories
The problem of smoothing mobile robot motions when cusps, i.e. changes of motion direction along the trajectory, are imposed is treated. The authors pinpoint some special curves, called…
Path planning using a potential field representation
  • Y. Hwang, N. Ahuja
  • Business
    Proceedings CVPR '89: IEEE Computer Society Conference on Computer Vision and Pattern Recognition
  • 1989
TLDR
An approach to the findpath problem using a potential-field representation of obstacles, where a potential function similar to an electrostatic potential is assigned to each obstacle, and the topological structure of the free space is derived in the form of minimum potential valleys.
Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape
TLDR
A worst-case lower bound on the length of paths generated by any algorithm operating within the framework of the accepted model is developed; the bound is expressed in terms of the perimeters of the obstacles met by the automaton in the scene.
Potential field methods and their inherent limitations for mobile robot navigation
  • Y. Koren, J. Borenstein
  • Medicine
    Proceedings. 1991 IEEE International Conference on Robotics and Automation
  • 1991
TLDR
Based on a rigorous mathematical analysis, the authors present a systematic overview and a critical discussion of the inherent problems of potential field methods (PFMs) and developed a new method for fast obstacle avoidance.
Real-Time Obstacle Avoidance for Manipulators and Mobile Robots
  • O. Khatib
  • Computer Science
    Autonomous Robot Vehicles
  • 1990
TLDR
This paper reformulated the manipulator con trol problem as direct control of manipulator motion in operational space—the space in which the task is originally described—rather than as control of the task's corresponding joint space motion obtained only after geometric and geometric transformation.
Computational geometry: algorithms and applications
TLDR
This introduction to computational geometry focuses on algorithms as all techniques are related to particular applications in robotics, graphics, CAD/CAM, and geographic information systems.
...
...