Corpus ID: 32743142

Investigation of the * (Star) Search Algorithms: Characteristics, Methods and Approaches - TI Journals

@article{Nosrati2012InvestigationOT,
  title={Investigation of the * (Star) Search Algorithms: Characteristics, Methods and Approaches - TI Journals},
  author={M. Nosrati and R. Karimi and Hojat Allah Hasanvand},
  journal={World Applied Programming},
  year={2012}
}
  • M. Nosrati, R. Karimi, Hojat Allah Hasanvand
  • Published 2012
  • Computer Science
  • World Applied Programming
  • Abstract: In this study, a branch of search algorithms that are called * (star) algorithms is taken to look. Star algorithms have different types and derivatives. They are A*, B*, D* (including original D*, Focused D* and D* Lite), IDA* and SMA*. Features, basic concepts, algorithm and the approaches of each type is investigated separately in this paper. 
    34 Citations

    Topics from this paper.

    An optimized method for A∗ algorithm based on directional guidance
    • Zhenguo Zhao, Runtao Liu
    • Computer Science
    • 2015 6th IEEE International Conference on Software Engineering and Service Science (ICSESS)
    • 2015
    • 2
    A optimization of A* algorithm to make it close to human pathfinding behavior
    • 2
    • PDF
    Performance of Buckets versus Min-Heap in the A* Search Algorithm
    Optimal path planning in cluttered environment using RRT*-AB
    • 20
    A new A-star algorithm adapted to the semi-automatic detection of cracks within grey level pavement images
    • 1
    Ship weather routing based on modified Dijkstra algorithm
    • 3
    • PDF

    References

    SHOWING 1-10 OF 13 REFERENCES
    The B* Tree Search Algorithm: A Best-First Proof Procedure
    • H. Berliner
    • Mathematics, Computer Science
    • Artif. Intell.
    • 1979
    • 222
    • PDF
    Lifelong Planning A
    • 451
    • PDF
    Depth-First Iterative-Deepening: An Optimal Admissible Tree Search
    • R. Korf
    • Mathematics, Computer Science
    • Artif. Intell.
    • 1985
    • 1,572
    • Highly Influential
    • PDF
    An Incremental Algorithm for a Generalization of the Shortest-Path Problem
    • 386
    • PDF
    Artificial Intelligence: A Modern Approach
    • 23,763
    • PDF
    The Focussed D* Algorithm for Real-Time Replanning
    • 975
    • PDF
    Fast replanning for navigation in unknown terrain
    • 433
    • Highly Influential
    • PDF
    World-championship-caliber Scrabble
    • B. Sheppard
    • Computer Science, Mathematics
    • Artif. Intell.
    • 2002
    • 146
    • PDF
    Performance bounds for planning in unknown terrain
    • 97
    • PDF
    Optimal and efficient path planning for partially-known environments
    • A. Stentz
    • Computer Science
    • Proceedings of the 1994 IEEE International Conference on Robotics and Automation
    • 1994
    • 1,278
    • PDF