The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Path planning using Laplace's equation
Abstract
A method for planning smooth robot paths is presented. The method relies on the use of Laplace's equation to constrain the generation of a potential function over regions of the configuration space of an effector. Once the function is computed, paths may be found very quickly. These functions do not exhibit the local minima which plague the potential field method. Unlike decompositional and algebraic techniques. Laplace's equation is very well suited to computation on massively parallel architectures.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Faires, J. D. (1978) · Cited by 6,711
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
The complexity of robot motion planning
Canny, J. (1988) · Medical Entomology and Zoology · Cited by 1,375
Bronshtein, I. N., Semendyayev, K. A., Musiol, G., & Muehlig, H. (2004) · Springer eBooks · doi:10.1007/978-3-662-05382-9 · Cited by 1,239
Fourier Series and Boundary Value Problems
Roberts, R. C., & Churchill, R. V. (1964) · Mathematics of Computation · doi:10.2307/2003439 · Cited by 605
Exact robot navigation by means of potential functions: Some topological considerations
Koditschek, D. (2005) · Proceedings. 1987 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1987.1088038 · Cited by 345
Complex Variables and Applications.
Trahan, D. H., Churchill, R. V., Brown, J. W., Verhey, R. F., Silverman, R. A., & Derrick, W. R. (1976) · The American Mathematical Monthly · doi:10.2307/2318854 · Cited by 254
Calculus of variations with applications to physics and engineering
Brown, H. H. (1952) · Journal of the Franklin Institute · doi:10.1016/0016-0032(52)90917-4 · Cited by 220
Calculus of variations : with applications to physics and engineering.
Weinstock, R. (1952) · Medical Entomology and Zoology · Cited by 215
Cited by
Exact robot navigation using artificial potential functions
Rimon, E., & Koditschek, D. E. (1992) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.163777 · Cited by 1,835
Path Planning for Autonomous Vehicles in Unknown Semi-structured Environments
Dolgov, D., Thrun, S., Montemerlo, M., & Diebel, J. (2010) · The International Journal of Robotics Research · doi:10.1177/0278364909359210 · Cited by 976
A Survey of Motion Planning Algorithms from the Perspective of Autonomous UAV Guidance
Goerzen, C., Kong, Z., & Mettler, B. (2010) · Journal of Intelligent and Robotic Systems · doi:10.1007/s10846-009-9383-1 · Cited by 779
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
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
Metadata
- Authors
- Connolly, C. I., Burns, J. B., & Weiss, R.
- Venue
- Proceedings., IEEE International Conference on Robotics and Automation
- Publisher
- IEEE Comput. Soc. Press
- Published
- 2002-12-04
- Pages
- 2102-2106
- ISSN
- 1050-4729 (ISSN-L)
- OpenAlex
- W2153612202
- Cited by
- 483
- References
- 16
- FWCI
- 18.90
- Type
- conference paper
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Path planning using Laplace's equation. https://app.cochat.ai/papers/10.1109/robot.1990.126315
- The paper
- Connolly, C. I., Burns, J. B., & Weiss, R. (2002). Path planning using Laplace's equation. Proceedings., IEEE International Conference on Robotics and Automation. https://doi.org/10.1109/robot.1990.126315
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.