The DOI matches its Crossref record; 35 of the 35 references it cites were found in a registry or an index.
Numerical potential field techniques for robot path planning
Abstract
An approach to robot path planning that consists of incrementally building a graph connecting the local minima of a potential field defined in the robot's configuration space and concurrently searching this graph until a goal configuration is attained is proposed. Unlike the so-called global path planning methods, this approach does not require an expensive computation step before the search for a path can actually start, and it searches a graph that is usually much smaller than the graph searched by the so-called local methods. A collection of effective techniques to implement this approach is described. They are based on the use of multiscale pyramids of bitmap arrays for representing both the robot's workspace and configuration space. This distributed representation makes it possible to construct potential fields numerically, rather than analytically. A path planner based on these techniques has been implemented. Experiments with this planner show that it is both very fast and capable of handling many degrees of freedom.>
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
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Stochastic relaxation, gibbs distributions, and the bayesian restoration of images.
Geman, S., & Geman, D. (1984) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1984.4767596 · Cited by 17,949
Probability, Random Variables, and Stochastic Processes.
Abrahams, J., & Papoulis, A. (1984) · Journal of the American Statistical Association · doi:10.2307/2288754 · Cited by 16,226
Probability, Random Variables, and Stochastic Processes
Miller, I. (1966) · Technometrics · doi:10.1080/00401706.1966.10490365 · Cited by 8,452
Real-Time Obstacle Avoidance for Manipulators and Mobile Robots
Khatib, O. (1986) · The International Journal of Robotics Research · doi:10.1177/027836498600500106 · Cited by 7,894 · cited 1×
“The choice of the function G is specially important because it highly influences the number and the depths of the local minima of U. A natural choice is to define U as the sum of the W-potentials [ 4 ], because it does not favor one control point over the others.”
BackgroundLatombe, J.-C. (1991) · Springer eBooks · doi:10.1007/978-1-4615-4022-9 · Cited by 6,396
Self-citationRandom variables and stochastic processes
Larson, H. J., & Shubert, B. O. (1979) · Wiley eBooks · Cited by 4,640
Image Analysis and Mathematical Morphology.
Diggle, P. J., & Serra, J. (1983) · Biometrics · doi:10.2307/2531038 · Cited by 3,894
Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm
Černý, V. (1985) · Journal of Optimization Theory and Applications · doi:10.1007/bf00940812 · Cited by 3,436
Data Structures and Algorithms
(2003) · Series on software engineering and knowledge engineering · doi:10.1142/9789812791245 · Cited by 2,117
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
Self-citationRandomized 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 Motion Planning for Agile Autonomous Vehicles
Frazzoli, E., Dahleh, M. A., & Feron, E. (2002) · Journal of Guidance, Control, and Dynamics · doi:10.2514/2.4856 · Cited by 830
Simulating Humans: Computer Graphics, Animation, and Control
Badler, N. I., Phillips, C. B., & Webber, B. L. (1993) · Oxford University Press eBooks · doi:10.1093/oso/9780195073591.001.0001 · Cited by 751
Safety-enhanced UAV path planning with spherical vector-based particle swarm optimization
Phung, M. D., & Ha, Q. P. (2021) · Applied Soft Computing · doi:10.1016/j.asoc.2021.107376 · Cited by 565
Path Planning for Autonomous Mobile Robots: A Review
Sánchez-Ibáñez, J. R., Pérez-del-Pulgar, C. J., & García-Cerezo, A. (2021) · Sensors · doi:10.3390/s21237898 · Cited by 462
Randomized preprocessing of configuration for fast path planning
Kavraki, L., & Latombe, J.-C. (2002) · Proceedings of the 1994 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1994.350966 · Cited by 412
Self-citationOptimal motion planning for multiple robots having independent goals
LaValle, S. M., & Hutchinson, S. A. (1998) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.736775 · Cited by 411
Using Real-Time Stereo Vision for Mobile Robot Navigation
Murray, D., & Little, J. J. (2000) · Autonomous Robots · doi:10.1023/a:1008987612352 · Cited by 403
Learning Motion Patterns of People for Compliant Robot Motion
Bennewitz, M., Burgard, W., Cielniak, G., & Thrun, S. (2005) · The International Journal of Robotics Research · doi:10.1177/0278364904048962 · Cited by 399
Liu, P., Chen, A. Y., Huang, Y.-N., Han, J.-Y., Lai, J.-S., Kang, S.-C., Wu, T.-H., Wen, M.-C., & Tsai, M.-H. (2014) · Smart Structures and Systems · doi:10.12989/sss.2014.13.6.1065 · Cited by 377
A randomized roadmap method for path and manipulation planning
Amato, N. M., & Wu, Y. (2002) · Proceedings of IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1996.503582 · Cited by 369
Glaser, S., Vanholme, B., Mammar, S., Gruyer, D., & Nouveliere, L. (2010) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2010.2046037 · Cited by 336
Nonholonomic navigation and control of cooperating mobile manipulators
Tanner, H. G., Loizou, S. G., & Kyriakopoulos, K. J. (2003) · IEEE Transactions on Robotics and Automation · doi:10.1109/tra.2002.807549 · Cited by 305
Robust hybrid control for autonomous vehicle motion planning
Frazzoli, E., Dahleh, M. A., & Feron, E. (2002) · Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187) · doi:10.1109/cdc.2000.912871 · Cited by 297
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 Random Sampling Scheme for Path Planning
Barraquand, J., Kavraki, L., Latombe, J.-C., Motwani, R., Li, T.-Y., & Raghavan, P. (1997) · The International Journal of Robotics Research · doi:10.1177/027836499701600604 · Cited by 277
Self-citationCoordinated path planning for multiple robots
Švestka, P., & Overmars, M. H. (1998) · Robotics and Autonomous Systems · doi:10.1016/s0921-8890(97)00033-x · Cited by 270
A survey on path planning for persistent autonomy of autonomous underwater vehicles
Zeng, Z., Lian, L., Sammut, K., He, F., Tang, Y., & Lammas, A. (2015) · Ocean Engineering · doi:10.1016/j.oceaneng.2015.10.007 · Cited by 256
Singletary, A., Klingebiel, K., Bourne, J., Browning, A., Tokumaru, P., & Ames, A. (2021) · 2021 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros51168.2021.9636670 · Cited by 182
Stigmergy at work: Planning and navigation for a service robot on an RFID floor
Khaliq, A. A., & Saffiotti, A. (2015) · 2015 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2015.7139311 · Cited by 28
Metadata
- Authors
- Barraquand, J., Langlois, B., & Latombe, J.-C.
- Venue
- IEEE Transactions on Systems, Man, and Cybernetics
- Published
- 1992
- Volume
- 22
- Issue
- 2
- Pages
- 224-241
- ISSN
- 0018-9472 (ISSN-L)
- OpenAlex
- W2053407718
- Cited by
- 889
- References
- 35
- FWCI
- 11.92
- 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.