Spatial Planning: A Configuration Space Approach
The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Abstract
This paper presents algorithms for computing constraints on the position of an object due to the presence of ther objects. This problem arises in applications that require choosing how to arrange or how to move objects without collisions. The approach presented here is based on characterizing the position and orientation of an object as a single point in a configuration space, in which each coordinate represents a degree of freedom in the position or orientation of the object. The configurations forbidden to this object, due to the presence of other objects, can then be characterized as regions in the configuration space, called configuration space obstacles. The paper presents algorithms for computing these configuration space obstacles when the objects are polygons or polyhedra.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Understanding natural language
Winograd, T. (1972) · Cognitive Psychology · doi:10.1016/0010-0285(72)90002-3 · Cited by 2,799
An algorithm for planning collision-free paths among polyhedral obstacles
Lozano-Pérez, T., & Wesley, M. A. (1979) · Communications of the ACM · doi:10.1145/359156.359164 · Cited by 2,304
An efficient algorith for determining the convex hull of a finite planar set
Graham, R. L. (1972) · Information Processing Letters · doi:10.1016/0020-0190(72)90045-2 · Cited by 1,653
Shamos, M. I., & Hoey, D. (1975) · 16th Annual Symposium on Foundations of Computer Science (sfcs 1975) · doi:10.1109/sfcs.1975.8 · Cited by 1,057
Algorithms for Reporting and Counting Geometric Intersections
Bentley, & Ottmann (1979) · IEEE Transactions on Computers · doi:10.1109/tc.1979.1675432 · Cited by 996
Schwartz, J. T., & Sharir, M. (1983) · Advances in Applied Mathematics · doi:10.1016/0196-8858(83)90014-3 · Cited by 801
Convex hulls of finite sets of points in two and three dimensions
Preparata, F. P., & Hong, S. J. (1977) · Communications of the ACM · doi:10.1145/359423.359430 · Cited by 710
THE KINEMATICS OF MANIPULATORS UNDER COMPUTER CONTROL
Peiper, D. L. (1968) · Cited by 708
Automatic Planning of Manipulator Transfer Movements
Lozano-Perez, T. (1981) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1981.4308589 · Cited by 692
Bottema, D., Roth, B., & Veldkamp, G. R. (1980) · Journal of Applied Mechanics · doi:10.1115/1.3153630 · Cited by 652
Cited by
Probabilistic roadmaps for path planning in high-dimensional configuration spaces
Kavraki, L. E., Svestka, P., Latombe, J.-C., & Overmars, M. H. (1996) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.508439 · Cited by 6,343
“First use the algorithm in [ 37 ] to produce the vertices of the obstacles in the link’s C-space.”
MethodRandomized Kinodynamic Planning
LaValle, S. M., & Kuffner, J. J. (2001) · The International Journal of Robotics Research · doi:10.1177/02783640122067453 · Cited by 3,254
Real-time obstacle avoidance for manipulators and mobile robots
Khatib, O. (2005) · Proceedings. 1985 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1985.1087247 · Cited by 1,757
Real-Time Obstacle Avoidance for Manipulators and Mobile Robots
Khatib, O. (1986) · Autonomous Robot Vehicles · doi:10.1007/978-1-4613-8997-2_29 · Cited by 1,569
A fast procedure for computing the distance between complex objects in three-dimensional space
Gilbert, E. G., Johnson, D. W., & Keerthi, S. S. (1988) · IEEE Journal on Robotics and Automation · doi:10.1109/56.2083 · Cited by 1,513
Optimal and Efficient Path Planning for Partially Known Environments
Stentz, A. (1997) · Intelligent Unmanned Ground Vehicles · doi:10.1007/978-1-4615-6325-9_11 · Cited by 1,233
Robot Motion Planning: A Distributed Representation Approach
Barraquand, J., & Latombe, J.-C. (1991) · The International Journal of Robotics Research · doi:10.1177/027836499101000604 · Cited by 995
Optimal and efficient path planning for partially-known environments
Stentz, A. (2002) · Proceedings of the 1994 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1994.351061 · Cited by 929
“Thus, the algorithm can be used for any planning representation, including visibility graphs [5] and grid cell structures.”
MethodAutomatic Synthesis of Fine-Motion Strategies for Robots
Lozano-Pérez, T., Mason, M. T., & Taylor, R. H. (1984) · The International Journal of Robotics Research · doi:10.1177/027836498400300101 · Cited by 898
Elastic bands: connecting path planning and control
Quinlan, S., & Khatib, O. (2002) · [1993] Proceedings IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1993.291936 · Cited by 793
Sampling-Based Robot Motion Planning: A Review
Elbanhawi, M., & Simic, M. (2014) · IEEE Access · doi:10.1109/access.2014.2302442 · Cited by 786
A review of mobile robots: Concepts, methods, theoretical framework, and applications
Rubio, F., Valero, F., & Llopis-Albert, C. (2019) · International Journal of Advanced Robotic Systems · doi:10.1177/1729881419839596 · Cited by 763
Toward Efficient Trajectory Planning: The Path-Velocity Decomposition
Kant, K., & Zucker, S. W. (1986) · The International Journal of Robotics Research · doi:10.1177/027836498600500304 · Cited by 753
Erdmann, M., & Lozano-Pérez, T. (1987) · Algorithmica · doi:10.1007/bf01840371 · Cited by 736
Automatic Planning of Manipulator Transfer Movements
Lozano-Perez, T. (1981) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1981.4308589 · Cited by 692
A Review of Motion Planning for Highway Autonomous Driving
Claussmann, L., Revilloud, M., Gruyer, D., & Glaser, S. (2020) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2019.2913998 · Cited by 670
A simple motion-planning algorithm for general robot manipulators
Lozano-Perez, T. (1987) · IEEE Journal on Robotics and Automation · doi:10.1109/jra.1987.1087095 · Cited by 618
Model-Based Recognition and Localization from Sparse Range or Tactile Data
Grimson, W. E. L., & Lozano-Pérez, T. (1984) · The International Journal of Robotics Research · doi:10.1177/027836498400300301 · Cited by 586
Real-time obstacle avoidance using harmonic potential functions
Kim, J.-O., & Khosla, P. (2002) · Proceedings. 1991 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1991.131683 · Cited by 559
Obstacle avoidance in a dynamic environment: a collision cone approach
Chakravarthy, A., & Ghose, D. (1998) · IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans · doi:10.1109/3468.709600 · Cited by 556
New lower bound techniques for robot motion planning problems
Canny, J., & Reif, J. (1987) · 28th Annual Symposium on Foundations of Computer Science (sfcs 1987) · doi:10.1109/sfcs.1987.42 · Cited by 538
Real-time obstacle avoidance using harmonic potential functions
Kim, J.-O., & Khosla, P. K. (1992) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.143352 · Cited by 522
Donald, B., Xavier, P., Canny, J., & Reif, J. (1993) · Journal of the ACM · doi:10.1145/174147.174150 · Cited by 458
Nearness Diagram (ND) Navigation: Collision Avoidance in Troublesome Scenarios
Minguez, J., & Montano, L. (2004) · IEEE Transactions on Robotics and Automation · doi:10.1109/tra.2003.820849 · Cited by 452
On the Relationship between Classical Grid Search and Probabilistic Roadmaps
LaValle, S. M., Branicky, M. S., & Lindemann, S. R. (2004) · The International Journal of Robotics Research · doi:10.1177/0278364904045481 · Cited by 436
Motion planning in a plane using generalized Voronoi diagrams
Takahashi, O., & Schilling, R. J. (1989) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.88035 · Cited by 417
Analysis of probabilistic roadmaps for path planning
Kavraki, L. E., Kolountzakis, M. N., & Latombe, J.-C. (2002) · Proceedings of IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1996.509171 · Cited by 409
Polack, P., Altche, F., d'Andrea-Novel, B., & de La Fortelle, A. (2017) · 2017 IEEE Intelligent Vehicles Symposium (IV) · doi:10.1109/ivs.2017.7995816 · Cited by 408
Differentially constrained mobile robot motion planning in state lattices
Pivtoraiko, M., Knepper, R. A., & Kelly, A. (2009) · Journal of Field Robotics · doi:10.1002/rob.20285 · Cited by 393
Dynamic path planning for a mobile automaton with limited information on the environment
Lumelsky, V., & Stepanov, A. (1986) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1986.1104175 · Cited by 388
VFH/sup */: local obstacle avoidance with look-ahead verification
Ulrich, I., & Borenstein, J. (2002) · Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065) · doi:10.1109/robot.2000.846405 · Cited by 386
Distance functions and their application to robot path planning in the presence of obstacles
Gilbert, E., & Johnson, D. (1985) · IEEE Journal on Robotics and Automation · doi:10.1109/jra.1985.1087003 · Cited by 367
Posture-based motion planning: Applications to grasping.
Rosenbaum, D. A., Meulenbroek, R. J., Vaughan, J., & Jansen, C. (2001) · Psychological Review · doi:10.1037/0033-295x.108.4.709 · Cited by 356
On the Relationship between Classical Grid Search and Probabilistic Roadmaps
LaValle, S. M., & Branicky, M. S. (2004) · Springer Tracts in Advanced Robotics · doi:10.1007/978-3-540-45058-0_5 · Cited by 338
Collision Detection for Moving Polyhedra
Canny, J. (1986) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1986.4767773 · Cited by 334
Guidelines in nonholonomic motion planning for mobile robots
Laumond, J. P., Sekhavat, S., & Lamiraux, F. (2006) · Lecture Notes in Control and Information Sciences · doi:10.1007/bfb0036070 · Cited by 330
Integrated task and motion planning in belief space
Kaelbling, L. P., & Lozano-Pérez, T. (2013) · The International Journal of Robotics Research · doi:10.1177/0278364913484072 · Cited by 328
Inevitable collision states — a step towards safer robots?
Fraichard, T., & Asama, H. (2004) · Advanced Robotics · doi:10.1163/1568553042674662 · Cited by 324
Qualitative spatial reasoning: The CLOCK project
Forbus, K. D., Nielsen, P., & Faltings, B. (1991) · Artificial Intelligence · doi:10.1016/0004-3702(91)90116-2 · Cited by 315
A knowledge based genetic algorithm for path planning of a mobile robot
Hu, Y., & Yang, S. X. (2004) · IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004 · doi:10.1109/robot.2004.1302402 · Cited by 296
Barraquand, J., & Latombe, J. C. (1993) · Algorithmica · doi:10.1007/bf01891837 · Cited by 293
Geometric reasoning about mechanical assembly
Wilson, R. H., & Latombe, J.-C. (1994) · Artificial Intelligence · doi:10.1016/0004-3702(94)90048-5 · Cited by 292
Neural Network Dynamics for Path Planning and Obstacle Avoidance
Glasius, R., Komoda, A., & Gielen, S. C. A. M. (1995) · Neural Networks · doi:10.1016/0893-6080(94)e0045-m · Cited by 289
A local based approach for path planning of manipulators with a high number of degrees of freedom
Faverjon, B., & Tournassoud, P. (2005) · Proceedings. 1987 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1987.1087982 · Cited by 281
A mobile robot exploration algorithm
Zelinsky, A. (1992) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.182671 · Cited by 273
Mobile Robot Control and Navigation: A Global Overview
Tzafestas, S. G. (2018) · Journal of Intelligent & Robotic Systems · doi:10.1007/s10846-018-0805-9 · Cited by 271
Planning motions with intentions
Koga, Y., Kondo, K., Kuffner, J., & Latombe, J.-C. (1994) · Proceedings of the 21st annual conference on Computer graphics and interactive techniques - SIGGRAPH '94 · doi:10.1145/192161.192266 · Cited by 269
The Belief Roadmap: Efficient Planning in Belief Space by Factoring the Covariance
Prentice, S., & Roy, N. (2009) · The International Journal of Robotics Research · doi:10.1177/0278364909341659 · Cited by 269
A dynamical system approach to realtime obstacle avoidance
Khansari-Zadeh, S. M., & Billard, A. (2012) · Autonomous Robots · doi:10.1007/s10514-012-9287-y · Cited by 264
“Global methods, such as those dealt with by path planning algorithms (Lozano-Perez 1983; Kuffner and LaValle 2000; Kavraki et al. 1996) ensures to find a valid solution, if it exists.”
Motion Planning: A Journey of Robots, Molecules, Digital Actors, and Other Artifacts
Latombe, J.-C. (1999) · The International Journal of Robotics Research · doi:10.1177/02783649922067753 · Cited by 264
A Hybrid Approach to Intricate Motion, Manipulation and Task Planning
Cambon, S., Alami, R., & Gravot, F. (2009) · The International Journal of Robotics Research · doi:10.1177/0278364908097884 · Cited by 256
Manipulator control with superquadric artificial potential functions: theory and experiments
Volpe, R., & Khosla, P. (1990) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/21.61211 · Cited by 254
A survey of robotic motion planning in dynamic environments
Mohanan, M. G., & Salgoankar, A. (2018) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2017.10.011 · Cited by 254
Metadata
- Authors
- Lozano-Perez
- Venue
- IEEE Transactions on Computers
- Published
- 1983-02
- Volume
- C-32
- Issue
- 2
- Pages
- 108-120
- ISSN
- 0018-9340 (ISSN-L)
- 1557-9956
- 2326-3814
- OpenAlex
- W2150500908
- Cited by
- 2,113
- References
- 23
- FWCI
- 50.15
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.