Editing A* search algorithm (section)

==Variants==
*[[Anytime A*]]<ref>{{cite journal |last1=Hansen |first1=Eric A. |first2=Rong |last2=Zhou |title=Anytime Heuristic Search |journal= Journal of Artificial Intelligence Research|volume=28 |issue= |pages=267–297 |date=2007 |doi= 10.1613/jair.2096|s2cid=9832874 |url=https://www.jair.org/index.php/jair/article/view/10489 |doi-access=free |arxiv=1110.2737 }}</ref>
*[[Any-angle path planning#A*-based|Block A*]]
*[[D*]]
*[[Any-angle path planning|Field D*]]
*[[Fringe search|Fringe]]
*[[Incremental heuristic search|Fringe Saving A* (FSA*)]]
*[[Incremental heuristic search|Generalized Adaptive A* (GAA*)]]
*[[Incremental heuristic search]]
*Reduced A*<ref> {{Cite journal|last1=Fareh|first1=Raouf|last2=Baziyad|first2=Mohammed|last3=Rahman|first3=Mohammad H.|last4=Rabie|first4=Tamer|last5=Bettayeb|first5=Maamar|date=2019-05-14|title=Investigating Reduced Path Planning Strategy for Differential Wheeled Mobile Robot|url=https://www.cambridge.org/core/journals/robotica/article/abs/investigating-reduced-path-planning-strategy-for-differential-wheeled-mobile-robot/6EDFFC11CEF00D0E010C0D149FE9C811|journal=Robotica|language=en|volume=38|issue=2|pages=235–255|doi=10.1017/S0263574719000572|s2cid=181849209|issn=0263-5747}}</ref>
*[[Iterative deepening A*|Iterative deepening A* (IDA*)]]
*[[Jump point search]]
*[[Lifelong Planning A*|Lifelong Planning A* (LPA*)]]
*New Bidirectional A* (NBA*)<ref>{{cite tech report |last1=Pijls |first1=Wim |last2=Post |first2=Henk |url=https://repub.eur.nl/pub/16100/ei2009-10.pdf |archive-url=https://web.archive.org/web/20140611141858/http://repub.eur.nl/pub/16100/ei2009-10.pdf |archive-date=2014-06-11 |url-status=live |title=Yet another bidirectional algorithm for shortest paths |id=EI 2009-10 |publisher=Econometric Institute, Erasmus University Rotterdam}}</ref>
*[[SMA*|Simplified Memory bounded A* (SMA*)]]
*[[Theta*]]

A* can also be adapted to a [[bidirectional search]] algorithm, but special care needs to be taken for the stopping criterion.<ref>{{cite web |last1=Goldberg |first1=Andrew V. |last2=Harrelson |first2=Chris |last3=Kaplan |first3=Haim |last4=Werneck |first4= Renato F. |title=Efficient Point-to-Point Shortest Path Algorithms |url=http://www.cs.princeton.edu/courses/archive/spr06/cos423/Handouts/EPP%20shortest%20path%20algorithms.pdf |publisher=[[Princeton University]] |archive-url=https://web.archive.org/web/20220518121847/https://www.cs.princeton.edu/courses/archive/spr06/cos423/Handouts/EPP%20shortest%20path%20algorithms.pdf |archive-date=18 May 2022 |url-status=live }}</ref>