paper-with-me

홈 › Papers

Using Restart Heuristics to Improve Agent Performance in Angry Birds

2019-05-30 · Tommy Liu, Jochen Renz, Peng Zhang, Matthew Stephenson

Over the past few years the Angry Birds AI competition has been held in an attempt to develop intelligent agents that can successfully and efficiently solve levels for the video game Angry Birds. Many different agents and strategies have been developed to solve the complex and challenging physical reasoning problems associated with such a game. However none of these agents attempt one of the key strategies which humans employ to solve Angry Birds levels, which is restarting levels. Restarting is important in Angry Birds because sometimes the level is no longer solvable or some given shot made has little to no benefit towards the ultimate goal of the game. This paper proposes a framework and experimental evaluation for when to restart levels in Angry Birds. We demonstrate that restarting is a viable strategy to improve agent performance in many cases.

📄 PDF Abstract BibTeX arXiv:1905.12877

Code (1)

uilymmot/restart-heuristics-for-angry-birds

Similar Papers 제목 키워드 기반

Towards Ultra Rapid Restarts

2014-02-18 · Shai Haim, Marijn Heule

We observe a trend regarding restart strategies used in SAT solvers. A few years ago, most state-of-the-art solvers restarted on average after a few thousands of backtracks. Currently, restarting after a dozen backtracks…

Deceptive Level Generation for Angry Birds

2021-06-03 · Chathura Gamage, Matthew Stephenson, Vimukthini Pinto, Jochen Renz

The Angry Birds AI competition has been held over many years to encourage the development of AI agents that can play Angry Birds game levels better than human players. Many different agents with various approaches have b…

Rapid Randomized Restarts for Multi-Agent Path Finding Solvers

2017-06-08 · Liron Cohen, Glenn Wagner, T. K. Satish Kumar, Howie Choset 외

Multi-Agent Path Finding (MAPF) is an NP-hard problem well studied in artificial intelligence and robotics. It has many real-world applications for which existing MAPF solvers use various heuristics. However, these solve…

Multi-Agent Path Finding

Heuristic Search For Physics-Based Problems: Angry Birds in PDDL+

2023-03-29 · Wiktor Piotrowski, Yoni Sher, Sachin Grover, Roni Stern 외

This paper studies how a domain-independent planner and combinatorial search can be employed to play Angry Birds, a well established AI challenge problem. To model the game, we use PDDL+, a planning language for mixed di…

Heuristic Search

Time-Fair Benchmarking for Metaheuristics: A Restart-Fair Protocol for Fixed-Time Comparisons

2025-09-10 · Junbo Jacob Lian arxiv

Numerous purportedly improved metaheuristics claim superior performance based on equivalent function evaluations (FEs), yet often conceal additional computational burdens in more intensive iterations, preprocessing stage…