{ "id": "ep46nkwst7", "slug": "artificial-potential-field-method", "title": "Artificial potential field method", "updated": "2026-10-15", "topic_path": [ { "id": "technology", "label": "Technology and the built world", "api_url": "https://www.edgepedia.org/api/v1/topics/technology" }, { "id": "technology.engineering", "label": "Engineering and manufacturing", "api_url": "https://www.edgepedia.org/api/v1/topics/technology.engineering" }, { "id": "technology.engineering.manufacturing.automation.robotics", "label": "Robotics and automation", "api_url": "https://www.edgepedia.org/api/v1/topics/technology.engineering.manufacturing.automation.robotics" }, { "id": "technology.engineering.manufacturing.automation.robotics.software-ai-and-methods", "label": "Robot software, AI, and methods", "api_url": "https://www.edgepedia.org/api/v1/topics/technology.engineering.manufacturing.automation.robotics.software-ai-and-methods" } ], "geo": [ { "id": "geo.nongeo.t1946.technology.engineering.manufacturing.automation.robotics", "label": "Non-geographic · 1946 to 2000: Robotics and automation", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.technology.engineering.manufacturing.automation.robotics", "path": [ { "id": "geo.nongeo", "label": "Non-geographic", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo" }, { "id": "geo.nongeo.t1946", "label": "Non-geographic · 1946 to 2000", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946" }, { "id": "geo.nongeo.t1946.technology", "label": "Technology and the built world", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.technology" }, { "id": "geo.nongeo.t1946.technology.engineering", "label": "Engineering and manufacturing", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.technology.engineering" }, { "id": "geo.nongeo.t1946.technology.engineering.manufacturing.automation.robotics", "label": "Robotics and automation", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.technology.engineering.manufacturing.automation.robotics" } ] } ], "excerpt": "The artificial potential field method is a robot path planning technique introduced by Oussama Khatib in 1986 that steers robots toward goals using attractive and repulsive forces.", "snippet": "The artificial potential field method is a robot path planning technique introduced by Oussama Khatib in 1986 that steers robots toward goals using attractive and repulsive forces.", "node": "technology.engineering.manufacturing.automation.robotics.software-ai-and-methods", "markdown": "# Artificial potential field method\n\nThe artificial potential field (APF) method is a robot path planning and control technique that steers a robot toward a goal by following the negative gradient of a synthetic potential combining goal attraction and obstacle repulsion. Because the field can be evaluated from onboard sensor data in real time, APF remains widely used as a local planner and reactive controller in quadcopters, autonomous cars, autonomous mobile robots, and ships.[1](https://iopscience.iop.org/article/10.1088/2631-8695/ae73e7) It produces a control force, and by integration a trajectory, without building a global map.\n\n| Key fact | Detail |\n|---|---|\n| Principle | Robot follows \\( F(q) = -\\nabla U(q) \\), the negative gradient of a combined attractive-plus-repulsive potential.[2](https://doi.org/10.1177/027836498600500106) |\n| Attractive potential | Quadratic well \\( U_{\\mathrm{att}}(q) = \\tfrac{1}{2} k_{\\mathrm{att}} \\| q - q_{\\mathrm{goal}} \\|^2 \\) with gain \\( k_{\\mathrm{att}} > 0 \\).[3](https://manipulapy.readthedocs.io/en/latest/user%5Fguide/Potential_Field.html) |\n| Repulsive potential | Inverse-distance form active only within an influence distance \\( d_0 \\) of each obstacle.[3](https://manipulapy.readthedocs.io/en/latest/user%5Fguide/Potential_Field.html) |\n| Computation cost | A single gradient evaluation costs microseconds and supports roughly 1 kHz control rates with no global map.[4](https://unseel.com/engineering/potential-field-navigation) |\n| Main failure mode | Local minima: when the attractive and repulsive forces cancel, the robot stalls before the goal.[2](https://doi.org/10.1177/027836498600500106) |\n| Key variants | Navigation functions, harmonic potential fields, vortex fields, and hybrid APF-RRT planners.[5](https://www.cs.cmu.edu/~motionplanning/lecture/Chap4-Potential-Field_howie.pdf) |\n\n## How it works\n\nThe method treats the robot as a particle moving in a field of forces: the goal position is an attractive pole and obstacles are repulsive surfaces.[2](https://doi.org/10.1177/027836498600500106) The total artificial potential is the sum of the two components,\n\n\\[ U_{\\mathrm{art}}(q) = U_{\\mathrm{att}}(q) + U_{\\mathrm{ob}}(q), \\]\n\nand the command force is the sum of the negative gradients, \\( F^{*} = F_{\\mathrm{att}} + F_{\\mathrm{rep}} \\) with \\( F_{\\mathrm{att}} = -\\nabla U_{\\mathrm{att}} \\) and \\( F_{\\mathrm{rep}} = -\\nabla U_{\\mathrm{ob}} \\).[2](https://doi.org/10.1177/027836498600500106) The repulsive potential is a nonnegative, continuously differentiable function that grows toward infinity at the obstacle surface but is limited to a region of influence bounded by a distance parameter \\( d_0 \\), so distant obstacles exert no force.[2](https://doi.org/10.1177/027836498600500106)\n\nIn the standard modern form, the attractive potential is the quadratic well \\( U_{\\mathrm{att}}(q) = \\tfrac{1}{2} k_{\\mathrm{att}} \\| q - q_{\\mathrm{goal}} \\|^2 \\), and the repulsive potential for obstacle \\( i \\) at distance \\( d_i = \\| q - o_i \\| \\) is\n\n\\[ U_{\\mathrm{rep}}(q) = \\sum_{i} \\tfrac{1}{2} k_{\\mathrm{rep}} \\left( \\tfrac{1}{d_i} - \\tfrac{1}{d_0} \\right)^2 \\quad \\text{if } d_i \\le d_0, \\quad 0 \\text{ otherwise,} \\]\n\nwith closed-form gradients \\( \\nabla U_{\\mathrm{att}} = k_{\\mathrm{att}} \\cdot (q - q_{\\mathrm{goal}}) \\) and \\( \\nabla U_{\\mathrm{rep}} = -\\sum_{i} k_{\\mathrm{rep}} \\cdot (1/d_i - 1/d_0) \\cdot (1/d_i^3) \\cdot (q - o_i) \\) over obstacles within the influence distance.[3](https://manipulapy.readthedocs.io/en/latest/user%5Fguide/Potential_Field.html) A conic attractive potential switched at a distance threshold \\( d^{*} \\) avoids the excessively large forces a pure quadratic produces far from the goal.[5](https://www.cs.cmu.edu/~motionplanning/lecture/Chap4-Potential-Field_howie.pdf) The gradient may be interpreted as force, acceleration, or velocity, but only the velocity interpretation guarantees asymptotic stability at the goal, which is why it is the most common choice.[1](https://iopscience.iop.org/article/10.1088/2631-8695/ae73e7) Adding damping lets the robot settle at the goal rather than oscillate around it.[6](https://modernrobotics.northwestern.edu/nu-gm-book-resource/10-6-virtual-potential-fields/)\n\n## How it is done\n\nA practitioner defines the goal configuration and the gains \\( k_{\\mathrm{att}} \\) and \\( k_{\\mathrm{rep}} \\), builds an obstacle or distance model (for manipulators, a grid distance map such as the brushfire algorithm, with several control points on the robot body), then iterates gradient descent\n\n\\[ q^{(i+1)} = q^{(i)} - \\alpha^{(i)} \\nabla U(q^{(i)}) \\]\n\nuntil the gradient norm falls below a threshold \\( \\varepsilon \\) or the goal is reached within tolerance; one documented implementation uses a step size of 0.05, a goal tolerance of \\( 10^{-3} \\), and up to about 100 steps.[5](https://www.cs.cmu.edu/~motionplanning/lecture/Chap4-Potential-Field_howie.pdf) • [3](https://manipulapy.readthedocs.io/en/latest/user%5Fguide/Potential_Field.html) For manipulators, workspace forces at the control points are mapped to joint torques through the Jacobian transpose, \\( J^{\\mathsf{T}} \\cdot f = u \\).[6](https://modernrobotics.northwestern.edu/nu-gm-book-resource/10-6-virtual-potential-fields/) • [5](https://www.cs.cmu.edu/~motionplanning/lecture/Chap4-Potential-Field_howie.pdf) Tuning matters: a high repulsive gain gives stronger avoidance but can create local minima, and a purely distance-proportional attraction gives excessive force at large distances and too little force near the goal, which is why improved versions segment the attractive potential at a distance threshold \\( d^{*} \\).[3](https://manipulapy.readthedocs.io/en/latest/user%5Fguide/Potential_Field.html) • [7](https://sage.cnpereading.com/doi/10.1177/00202940241268612)\n\n## Origin\n\nOussama Khatib introduced the artificial potential field method for real-time obstacle avoidance of manipulators and mobile robots in \"Real-Time Obstacle Avoidance for Manipulators and Mobile Robots,\" published in The International Journal of Robotics Research in 1986.[2](https://doi.org/10.1177/027836498600500106) The method descends from Khatib's work on end-effector motion control and obstacle avoidance with Jean-François Le Maitre, implemented for an MA23 manipulator at the Laboratoire d'Automatique de [Montpellier](https://www.edgepedia.org/montpellier) in 1978.[2](https://doi.org/10.1177/027836498600500106) Khatib presented the potential field approach and [operational space formulation](https://www.edgepedia.org/operational-space-formulation), implemented in the COSMOS system for a PUMA 560 robot, in a 1985 Yale Workshop paper[8](https://doi.org/10.1007/978-1-4757-1895-9_26) and in the 1986 journal paper; the COSMOS demonstrations included real-time collision avoidance with moving obstacles using visual sensing.[2](https://doi.org/10.1177/027836498600500106) The theoretical response came from Daniel E. Koditschek and Elon Rimon's 1990 work on robot [navigation functions](https://www.edgepedia.org/navigation-function) on manifolds with boundary,[9](https://doi.org/10.1016/0196-8858%2890%2990017-s) and from harmonic-function planning introduced by C. I. Connolly, J. B. Burns, and R. Weiss in 1990.[10](https://onlinelibrary.wiley.com/doi/10.1002/rob.4620100704) An influential critique identified four inherent problems of potential field navigation.[11](https://www2.cs.sfu.ca/~vaughan/teaching/415/papers/PF_limitations.pdf)\n\n## Variants\n\nNavigation functions are potentials \\( \\varphi: Q \\to [0,1] \\) that are smooth (at least \\( C^2 \\)), have a unique minimum at the goal, are uniformly maximal on the boundary of free space, and are Morse; constructed on a sphere world with a tunable exponent \\( \\kappa \\) and extended to star worlds by diffeomorphism, they guarantee the goal is the only stationary point, but they are computable only for a limited class of systems.[5](https://www.cs.cmu.edu/~motionplanning/lecture/Chap4-Potential-Field_howie.pdf) • [6](https://modernrobotics.northwestern.edu/nu-gm-book-resource/10-6-virtual-potential-fields/) Harmonic potential fields satisfy [Laplace's equation](https://www.edgepedia.org/laplaces-equation) and therefore have no spurious local minima; Keisuke Sato's 1992 Laplace potential field targeted deadlock-free motion planning,[12](https://doi.org/10.1163/156855393x00285) and J. Barraquand, B. Langlois, and J.-C. Latombe's 1992 numerical technique assigned an electrostatic-like potential to each obstacle, derived free-space topology as minimum potential valleys, and combined a global planner along those valleys with a local collision-avoidance planner.[13](https://doi.org/10.1109/21.148426) Y. K. Hwang and N. Ahuja's 1992 formulation treated path planning as numerical optimization over a potential field.[14](https://doi.org/10.1109/70.127236) Vortex fields rotate the repulsive force to be tangential to equipotential contours, avoiding local minima but no longer guaranteeing collision-free operation.[1](https://iopscience.iop.org/article/10.1088/2631-8695/ae73e7) Other remedies include virtual walls that bypass predicted minima,[15](https://pdfs.semanticscholar.org/9be6/859309f47056807d6cf25ee6dfc2b0dcd899.pdf) the Bacteria APF (BAPF), which replaces gradient descent with combinatorial optimization over candidate points around the agent,[16](https://export.arxiv.org/pdf/2210.17482v4.pdf) and learning-augmented schemes in which neural networks learn or adapt the field.[17](https://www.nature.com/articles/s41598-025-96614-2)\n\n## Applications\n\nBeyond Khatib's original manipulator demonstrations, APF is used in quadcopters, autonomous cars, autonomous mobile robots, and ships.[1](https://iopscience.iop.org/article/10.1088/2631-8695/ae73e7) UAV applications include obstacle- and collision-free communication relay positioning[18](https://doi.org/10.1007/s10846-012-9761-y) and following ground moving targets with a dynamic APF.[19](https://doi.org/10.1109/access.2020.3032929) A common practical role is as the local layer inside hybrid planners: a global planner (A*, RRT, or a sampling method) picks the route and the field handles avoidance between waypoints.\n\n## Limitations and alternatives\n\nBorenstein and Koren identified four inherent problems: trap situations due to local minima, no passage between closely spaced obstacles, oscillations in the presence of obstacles, and oscillations in narrow passages.[11](https://www2.cs.sfu.ca/~vaughan/teaching/415/papers/PF_limitations.pdf) Stagnation occurs when the attractive and repulsive forces cancel, producing a non-goal stationary point of the total potential, commonly near convex obstacles or a wall perpendicular to the trajectory; in narrow corridors the repulsive potential can exceed the attractive potential, making traversal impossible.[1](https://iopscience.iop.org/article/10.1088/2631-8695/ae73e7) A further failure is GNRON (goal non-reachable with obstacles): when the goal lies within an obstacle's influence radius, the repulsive force persistently dominates and the goal becomes unreachable.[20](https://www.mdpi.com/2504-446X/10/4/240) The method is also sensitive to parameter tuning, and basic static-obstacle formulations do not account for obstacle motion, although dynamic extensions can incorporate moving obstacles.[17](https://www.nature.com/articles/s41598-025-96614-2) Remedies fall into three families: redesigning the repulsive potential, adaptively scaling the attractive and repulsive weights, and hybridizing with prediction, optimization, global planning, or teleoperation.[1](https://iopscience.iop.org/article/10.1088/2631-8695/ae73e7) Compared with A*, which guarantees completeness and optimality,[17](https://www.nature.com/articles/s41598-025-96614-2) or with RRT*, which performs offline global search over thousands of iterations, APF trades completeness for constant-time onboard inference; hybrid schemes recover reliability only at the cost of significantly increased computation.[1](https://iopscience.iop.org/article/10.1088/2631-8695/ae73e7) • [20](https://www.mdpi.com/2504-446X/10/4/240) Reviews position APF against local planners of similar complexity, such as the Dynamic Window Approach and Timed Elastic Band, rather than against global planners.[1](https://iopscience.iop.org/article/10.1088/2631-8695/ae73e7)\n\n## References\n\n1. [Artificial potential fields revisited: advances, limitations, and hybrid solutions in modern robotics](https://iopscience.iop.org/article/10.1088/2631-8695/ae73e7)\n2. [Oussama Khatib (1986). Real-Time Obstacle Avoidance for Manipulators and Mobile Robots. The International Journal of Robotics Research.](https://doi.org/10.1177/027836498600500106)\n3. [Potential Field Module User Guide (ManipulaPy documentation)](https://manipulapy.readthedocs.io/en/latest/user%5Fguide/Potential_Field.html)\n4. [Potential Field Path Planning, Explained, Formula & Interactive (Unseel)](https://unseel.com/engineering/potential-field-navigation)\n5. [Robotic Motion Planning: Potential Functions (CMU 16-735 lecture notes, Howie Choset)](https://www.cs.cmu.edu/~motionplanning/lecture/Chap4-Potential-Field_howie.pdf)\n6. [Modern Robotics, Chapter 10.6: Virtual Potential Fields](https://modernrobotics.northwestern.edu/nu-gm-book-resource/10-6-virtual-potential-fields/)\n7. [Integration of improved APF and RRT algorithms for enhanced path planning in mobile robotics (Measurement and Control, SAGE)](https://sage.cnpereading.com/doi/10.1177/00202940241268612)\n8. [Oussama Khatib (1986). The Potential Field Approach And Operational Space Formulation In Robot Control. .](https://doi.org/10.1007/978-1-4757-1895-9_26)\n9. [Robot navigation functions on manifolds with boundary (Advances in Applied Mathematics, 1990)](https://doi.org/10.1016/0196-8858%2890%2990017-s)\n10. [The applications of harmonic functions to robotics](https://onlinelibrary.wiley.com/doi/10.1002/rob.4620100704)\n11. [Potential Field Methods and Their Inherent Limitations for Mobile Robot Navigation](https://www2.cs.sfu.ca/~vaughan/teaching/415/papers/PF_limitations.pdf)\n12. [Keisuke Sato (1992). Deadlock-free motion planning using the Laplace potential field. Advanced Robotics.](https://doi.org/10.1163/156855393x00285)\n13. [J. Barraquand, B. Langlois, J.-C. Latombe (1992). Numerical potential field techniques for robot path planning. IEEE Transactions on Systems Man and Cybernetics.](https://doi.org/10.1109/21.148426)\n14. [Y.K. Hwang, N. Ahuja (1992). A potential field approach to path planning. IEEE Transactions on Robotics and Automation.](https://doi.org/10.1109/70.127236)\n15. [Efficient Local Path Planning Algorithm Using Artificial Potential Field Supported by Augmented Reality](https://pdfs.semanticscholar.org/9be6/859309f47056807d6cf25ee6dfc2b0dcd899.pdf)\n16. [Improved Artificial Potential Field-Based Path Planning Algorithms for Resource-Constrained Agents in Unknown Cluttered Environments (arXiv 2210.17482)](https://export.arxiv.org/pdf/2210.17482v4.pdf)\n17. [Simulation-based review of classical, heuristic, and metaheuristic path planning algorithms | Scientific Reports](https://www.nature.com/articles/s41598-025-96614-2)\n18. [Omer Cetin, Ibrahim Zagli, Guray Yilmaz (2012). Establishing Obstacle and Collision Free Communication Relay for UAVs with Artificial Potential Fields. Journal of Intelligent & Robotic Systems.](https://doi.org/10.1007/s10846-012-9761-y)\n19. [Herath Mpc Jayaweera, Samer Hanoun (2020). A Dynamic Artificial Potential Field (D-APF) UAV Path Planning Technique for Following Ground Moving Targets. IEEE Access.](https://doi.org/10.1109/access.2020.3032929)\n20. [Hierarchical Neural-Guided Navigation with Vortex Artificial Potential Field for Robust Path Planning in Complex Environments (Drones, MDPI, 2026)](https://www.mdpi.com/2504-446X/10/4/240)\n\n---\n*Topic: Encyclopedia › Technology and the built world › Engineering and manufacturing › Robotics and automation › Robot software, AI, and methods*\n\n*Initially written Sep 29, 2026 · Edited: Oct 15, 2026*\n\n*Copyright 2026 EdgeChat AI, a subsidiary of Biostate AI.*\n\nLicense: Edgepedia Community License 1.0, https://www.edgepedia.org/edgepedia/license\n", "same_as": [ "https://www.cs.cmu.edu/~motionplanning/lecture/Chap4-Potential-Field_howie.pdf" ], "url": "https://www.edgepedia.org/artificial-potential-field-method", "markdown_url": "https://www.edgepedia.org/artificial-potential-field-method.md", "license": { "name": "Edgepedia Community License 1.0", "url": "https://www.edgepedia.org/edgepedia/license", "summary": "Free with credit, commercial use included. AI training is open to everyone. For other uses, organizations over USD 100M in revenue or 100M monthly users license separately.", "spdx": "LicenseRef-Edgepedia-Community-1.0" }, "credit": "\"Artificial potential field method\", Edgepedia (EdgeChat), https://www.edgepedia.org/artificial-potential-field-method. Edgepedia Community License 1.0.", "credit_md": "\"[Artificial potential field method](https://www.edgepedia.org/artificial-potential-field-method)\", Edgepedia (EdgeChat), [https://www.edgepedia.org/artificial-potential-field-method](https://www.edgepedia.org/artificial-potential-field-method). [Edgepedia Community License 1.0](https://www.edgepedia.org/edgepedia/license).", "credit_html": "\"Artificial potential field method\", Edgepedia (EdgeChat), https://www.edgepedia.org/artificial-potential-field-method. Edgepedia Community License 1.0.", "speakable": "The artificial potential field method is a robot path planning technique introduced by Oussama Khatib in 1986 that steers robots toward goals using attractive and repulsive forces." }