Literature Review: Application of Search Algorithms in Practical Problems

Title Authors Ye Source AI Topic Problem Methodol Key Limitation Real-

ar Area Statement ogy Contributi s World
Adopted on Application
s
Hill- Wei Lu 201 Springer Hill Implement Demonstra Provided Limited to Educational
Climbing 6 Climbing heuristic ted hill- practical educational robotics
Search and search climbing insights contexts; programmin
Its strategies in algorithm into scalability g
Implementat educational implement heuristic not
ion with robotics ation using search in addressed
Lego leJOS EV3 robotics
Mindstorms education
A Heuristic Nicolas 201 arXiv AO* Optimal Developed Improved Specific to Autonomou
Search Meuleau 4 planning in HAO*, a planning planetary s planning
Approach to et al. stochastic generalizat efficiency exploration for
Planning domains ion of for ; needs planetary
with with AO* planetary validation rovers
Continuous continuous algorithm exploration in other
Resources in resources for hybrid rovers domains
Stochastic state
Domains spaces
Rapid Krispin 201 Springer Hill Enhance Applied Achieved May not Real-time
Control A. 2 Climbing control hill- faster handle robotic
Selection Davies selection climbing control highly control
through Hill- et al. speed in methods decisions in dynamic systems
Climbing robotics for rapid robotic environmen
Methods control application ts
selection s effectively
An improved Bing Fu, 201 ScienceDire A* Search Improve An Proposes a May still Industrial
A* algorithm Lin 8 ct Algorithm path enhanced practical face robotic
for the Chen, planning in A* with A* variant computatio arms,
industrial Yuntao complex optimizati that is more nal automated
robot path Zhou, industrial on efficient challenges manufacturi
planning Dong environmen strategies and in highly ng systems
with high Zheng, ts with to reduce successful dynamic or
success rate Zhiqi higher path length in real-time
and short Wei, Jun success and and industrial changing
length Dai, shorter path improve path environmen
Haihong length feasibility planning ts
Pan in tasks
cluttered
environme
nts
Real-time R. Kala, 201 Journal of A* Find real- Improved Adaptable Computatio Autonomou
Path K. 0 Intelligent time paths A* with real-time nally s robotic
Planning Warwick & Robotic in dynamic dynamic robotic intensive in pathfinding
Using A* Systems environmen updates navigation highly
Algorithm ts for robots dynamic
scenarios
Applying David 200 AI Game DFS Solve Optimized Efficient Not Puzzle and
Depth-First Levy 6 Programmin complex depth-first solving of optimal for game
Search to g Wisdom puzzle search challenging all puzzles solving
Solve levels in with puzzle due to engines
Sokoban Sokoban pruning instances memory
stack
overflow
Search- S. M. 200 IEEE BFS, DFS Motion Hybrid Enhanced Limited to Mobile
based LaValle 6 Transaction planning for BFS/DFS trajectory 2D robot
Motion s on non- in generation planning navigation
Planning for Robotics holonomic configurati with fewer environmen
Mobile mobile on space collisions ts
Robots robots
Route Tariq M. 201 IEEE A* Efficient Modified Improved Limited Logistics
Optimizatio et al. 9 Xplore delivery A* delivery adaptability and delivery
n Using routing in incorporati efficiency to sudden systems
Modified A* urban areas ng traffic and time traffic
Algorithm and prediction changes
delivery
time
AO* John 200 Game AO* Create Applied Real-time Complexity Game
Algorithm Funge 4 Developers adaptive AI AO* for decision- increases developmen
for Adaptive Conference for dynamic strategic making in with t AI
Game AI game planning games environmen
environmen t dynamics
ts
Efficient D. 200 IJRR A* Plan Heuristic- Efficient Applicable Robotic
Heuristic Berenso 9 manipulatio guided A* arm mostly to grasping
Search in n et al. n actions for motion planning structured and
Robotic for robots planning with fewer environmen manipulatio
Manipulatio collisions ts n
n
Exploration Anusha 201 Springer Hill Explore Local hill Faster Fails in Disaster
with Hill Nagendr 3 Climbing unknown climbing exploration local response
Climbing in an et al. areas with with in optima robots
Unknown mobile terrain structured scenarios
Terrains robots estimation terrains
Memory- Shlomo 199 Artificial AO* Search with Introduced Effective Performanc Embedded
Bounded Zilberste 5 Intelligence limited Simplified trade-off e drops systems and
Heuristic in Journal memory for Memory- between with games
Search large Bounded memory severely
problems A* and limited
(SMA*) performanc memory
e
Parallel A* P. 201 Elsevier A* Speed up Parallelize Significant Requires Real-time
Algorithm Kumar 7 A* for real- d A* using time multi-core GPS
for Real- et al. time multi- reduction processing navigation
Time navigation threading for large power systems
Applications tasks graphs
A Depth- Hang 201 AAAI DFS Pathfinding DFS-based Reduced Not Warehouse
First Search Ma, 6 Conference for multiple conflict- collisions optimal in automation
Framework Sven agents in resolution in multi- time- and drone
for Solving Koenig shared algorithm agent critical fleets
Multi-Agent space systems application
Pathfinding s
Deep Xiangyu 201 arXiv Deep Enhancing Survey of Comprehen Survey Search
Reinforceme Zhao, 8 Reinforce performanc DRL sive review only; engines,
nt Learning Long ment e of online methods in of DRL limited recommend
for Search, Xia, Learning systems like various application real-world ation
Recommend Jiliang search, systems s in online experiment systems,
ation, and Tang, recommend services ation online
Online Dawei ation, and advertising
Advertising: Yin ads
A Survey
Firefly Xin-She 201 arXiv Swarm Optimizatio Firefly Overview Performanc Engineering
Algorithm: Yang, 3 Intelligenc n problems algorithm of recent e depends design,
Recent Xingshi e, in with developme on problem scheduling,
Advances He Metaheuri engineering parameter nts and type and feature
and stics and science tuning and application tuning selection
Applications hybridizati s of Firefly
on algorithm
Cuckoo Xin-She 201 arXiv Nature- Solving Enhanced Survey of Parameter Logistics,
 Search: Yang, 4 inspired global cuckoo advanceme sensitivity power
Recent Suash Algorithm optimizatio search nts and and systems,
Advances Deb s n problems with Lévy real-world convergenc image
and across flight implementa e speed processing
Applications domains mechanis tions
ms
A Mengzh 202 arXiv Graph- Efficient Comparati Provides Limited to Recommen
Comprehens ao 1 Based retrieval in ve analysis taxonomy specific dation
ive Survey Wang, Search high- of 13 and datasets systems,
and Xiaolian Algorithm dimensional graph- performanc and information
Experimenta g Xu, s data spaces based e scenarios retrieval
l Qiang ANNS benchmark
Comparison Yue, algorithms s
of Graph- Yuxiang
Based Wang
Approximat
e Nearest
Neighbor
Search
AlphaDev: Daniel 202 Nature Deep Discovering Reinforce Found Focused on Compiler
Discovering J. 3 Reinforce efficient ment faster small-scale optimizatio
Faster Manko ment sorting learning sorting sorting; ns, software
Sorting witz et Learning algorithms applied to algorithms scalability engineering
Algorithms al. algorithm than untested
Using Deep discovery human-
Reinforceme designed
nt Learning ones
Comparative Zhang et 202 SpringerOp Search Solving Compariso Provides Focused on Game AI,
Analysis of al. 4 en Algorithm combinatori n of BFS, insights specific educational
AI-Based s al puzzles DFS, and into problem; tools
Search efficiently other algorithm generalizati
Algorithms search efficiency on needed
in Solving 8 algorithms
Puzzle
Problems
Bees Pham et 200 IMechE Swarm Continuous Bees Demonstrat Performanc Engineering
Algorithm: al. 9 Intelligenc optimizatio algorithm es e depends design,
Modeling e n problems inspired by effectivene on scheduling
Foraging foraging ss in parameter
Behavior to behavior various settings
Solve optimizatio
Continuous n tasks
Optimizatio
n Problems
PageRank David F. 201 SIAM Graph Ranking Applicatio Extends May not Bibliometri
Beyond the Gleich 5 Review Algorithm nodes in a n of PageRank capture cs, biology,
Web s network PageRank to scientific domain- social
algorithm impact, specific network
to various biology, nuances analysis
domains etc.
Barret 201 arXiv Neural Automate Applied Achieved Computatio Image
Neural Zoph, 7 Architectu the design reinforcem state-of- nally recognition,
Architectur Quoc V. re Search of neural ent the-art intensive; natural
e Search Le network learning to performanc search language
with architecture search for e on image space can processing
Reinforcem s optimal classificati be vast
ent neural on tasks
Learning network
structures
HyFlex: A Edmun 201 arXiv Heuristic Develop a Introduced Facilitates Limited to Scheduling,
Benchmark d 1 Search framework HyFlex, a developme the bin packing,
Framework for software nt and problems flow shop
 for Cross- Burke, adaptive, framework comparison implemente problems
domain Tim cross- supporting of heuristic d within the
Heuristic Curtois, domain multiple algorithms framework
Search Matthe heuristic combinato across
w search rial domains
Hyde, algorithms optimizati
Gabriel on
a problems
Ochoa,
Jose A.
Vazque
z-
Rodrig
uez
Daniel 201 A* Enhance A* Introduced Significantl Limited to Video
Jump Point Harabor, 1 AAAI Optimizati algorithm Jump y reduced uniform games,
Search: Alban Conferenc on efficiency Point computatio cost grids; robotics,
Fast A* Grastien e in grid- Search to n time may not simulation
Pathfinding Proceeding based reduce while generalize environmen
for Uniform s pathfinding symmetrie maintainin to all ts
Cost Grids s and g pathfinding
improve optimality scenarios
performan
ce
A Simulated A. A. A. 201 Internationa Hill Develop Implement Demonstrat Susceptible Simulated
Motion El- 4 l Journal of Climbing motion ed hill ed to local robotics and
Planning Sayed, Computer planning for climbing effectivene maxima; virtual
Algorithm in M. M. Application AI agents in algorithm ss of hill may not environmen
2D and 3D El- s 2D and 3D for climbing in find global t navigation
Environmen Bakry, spaces simulated complex optimal
ts Using Hill M. A. environme spatial paths
Climbing El-Bakry nts planning
Y. 202 Electronics Enhance Introduced Improved May Autonomou
Research Wang, 3 (MDPI) Jump mobile adaptive path require s mobile
on Mobile L. Point robot path weight smoothness further robots in
Robot Path Zhang, Search planning coefficient and validation industrial
Planning H. Li, Z. efficiency s and reduced in highly environmen
Based on an Liu, Y. and safety dynamic search time dynamic or ts
Improved Li constraint in dynamic unpredictab
Bidirection circles in environme le settings
al Jump JPS nts
Point
Search
Algorithm
Application Yendriza 202 Internationa Hill Solve the 8- Applied Demonstrat May get Educational
of Artificial l 2 l Journal of Climbing puzzle steepest ed stuck in tools and AI
Intelligence Information problem ascent hill algorithm's local problem-
on Puzzle-8 System & using AI climbing capability optima; not solving
Using Technology techniques algorithm in puzzle- guaranteed demonstrati
Steepest solving to find the ons
Ascent Hill tasks best
Climbing solution
Algorithm
Jump Point D. 202 Jump Address Extended Enabled Complexity Robotics
Harabor, 0 ICAPS Point pathfinding JPS to efficient increases and
Search with
P. J. Conferenc Search with time- handle planning in with the autonomous
Temporal
Obstacles Stuckey e dependent temporal dynamic number of vehicle
Proceeding obstacles constraints temporal temporal navigation
s environme obstacles
nts
Pathfinding 201 Journal of Pathfindin Efficiently Implement Converted Static maps AI for non-
in Strategy Nawaf 6 Computer g in finding the ed the A* maps to only player
Games and Hazim and Games shortest search images to and No characters
Maze Barnout Communica and Maze path in algorithm simulate dynamic (NPCs) in
Solving i, Sinan tions Solving strategy on image- terrains path strategy
Using A* Sameer (Scientific games and based and recalculatio games
Search Mahmo Research maze maps Applied A* ns. , Maze-
Algorithm od Al- Publishing - environmen where to Needs solving in
Dabbag SCIRP) ts using a different pathfinding more educational
h, search- terrains are as well as complex robotics
Mustaf based color- Tested on real-world , Path
a Abdul method. coded 100 images testing planning in
Sahib (e.g., with >85% simulation
Naser ground, success rate environmen
water, ts
amphibiou
s).