Arthur Huang

University of California, Berkeley

Papers

2

Total Citations

77

H-Index

2

About

Arthur Huang is a leading researcher in artificial intelligence, with a primary focus on heuristic search and path-planning algorithms. His most significant contributions lie in the development of anytime algorithms, which are designed to quickly generate a feasible solution and then iteratively improve it as computational time allows. Huang is best known for introducing ANA* (Anytime Nonparametric A*), a groundbreaking algorithm that eliminates the need for a user-defined weighting parameter, automatically balancing solution speed and optimality. This work, detailed in his highly cited papers "Anytime Nonparametric A*" (41 citations) and "ANA*: anytime nonparametric A*" (36 citations), represents a major advancement over earlier methods like ARA*. By making heuristic search more adaptive and user-friendly, Huang’s research has had a profound impact on robotics, video games, and autonomous navigation, where real-time decision-making is critical. His innovative approach to nonparametric search continues to influence the field, enabling more efficient and intelligent pathfinding in dynamic environments.

Research Focus

Key Achievements

2
H-Index
2
Papers
77
Total Citations
39
Avg Citations/Paper
🏆 Most Cited Paper
Anytime Nonparametric A*
41 citations · 2011
📈 Most Prolific Year: 2011 (2 Papers)
🤝 Key Collaborators: 3
🏛 Institutions: University of California, Berkeley

Top Papers

  1. 1
    Anytime Nonparametric A*
    41 citations · 2011
  2. 2
    ANA*: anytime nonparametric A*
    36 citations · 2011

Key Collaborators

Contact & Links

Available for collaboration
Content generated · 12 days ago