default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNathan R. Sturtevant
Person information
- affiliation: University of Alberta, Department of Computing Science, Edmonton, AB, Canada
- affiliation: University of Denver, CO, USA
- affiliation (PhD): University of California, Los Angeles, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c159]Thayne T. Walker, Nathan R. Sturtevant, Ariel Felner:
Clique Analysis and Bypassing in Continuous-Time Conflict-Based Search. AAMAS 2024: 2540-2542- [c158]Lior Siag, Shahaf S. Shperberg, Ariel Felner, Nathan R. Sturtevant:
On Parallel External-Memory Bidirectional Search. ECAI 2024: 4190-4197 - [c157]Saman Ahmadi
, Nathan R. Sturtevant, Daniel Harabor, Mahdi Jalili:
Exact Multi-objective Path Finding with Negative Weights. ICAPS 2024: 11-19 - [c156]Sumedh Pendurkar, Levi H. S. Lelis, Nathan R. Sturtevant, Guni Sharon:
Curriculum Generation for Learning Guiding Functions in State-Space Search Algorithms. SOCS 2024: 91-99 - [c155]Shahaf S. Shperberg, Ariel Felner, Lior Siag, Nathan R. Sturtevant:
On the Properties of All-Pair Heuristics. SOCS 2024: 127-133 - [c154]Thayne T. Walker, Nathan R. Sturtevant, Ariel Felner:
Clique Analysis and Bypassing in Continuous-Time Conflict-Based Search. SOCS 2024: 152-160 - [c153]Lior Siag, Shahaf S. Shperberg, Ariel Felner, Nathan R. Sturtevant:
On Parallel External-Memory Bidirectional Search (Extended Abstract). SOCS 2024: 283-284 - [i12]Douglas Rebstock, Christopher Solinas, Nathan R. Sturtevant, Michael Buro:
Transformer Based Planning in the Observation Space with Applications to Trick Taking Card Games. CoRR abs/2404.13150 (2024) - [i11]Thayne T. Walker, Nathan R. Sturtevant:
On the Completeness of Conflict-Based Search: Temporally-Relative Duplicate Pruning. CoRR abs/2408.09028 (2024) - 2023
- [j21]Dor Atzmon, Ariel Felner, Jiaoyang Li, Shahaf S. Shperberg, Nathan R. Sturtevant, Sven Koenig:
Conflict-tolerant and conflict-free multi-agent meeting. Artif. Intell. 322: 103950 (2023) - [c152]Reza Mashayekhi, Dor Atzmon, Nathan R. Sturtevant:
Analyzing and Improving the Use of the FastMap Embedding in Pathfinding Tasks. AAAI 2023: 12473-12481 - [c151]Eugene You Chen Chen, Adam White, Nathan R. Sturtevant:
Entropy as a Measure of Puzzle Difficulty. AIIDE 2023: 34-42 - [c150]Debraj Ray, Nathan R. Sturtevant:
Navigation in Adversarial Environments Guided by PRA* and a Local RL Planner. AIIDE 2023: 343-351 - [c149]Dor Atzmon, Shahaf S. Shperberg, Netanel Sabah, Ariel Felner, Nathan R. Sturtevant:
W-restrained Bidirectional Bounded-Suboptimal Heuristic Search. ICAPS 2023: 26-30 - [c148]Seth Cooper, Faisal Abutarab, Emily Halina, Nathan R. Sturtevant:
Visual Exploration of Tile Datasets. EXAG@AIIDE 2023 - [c147]Lior Siag, Shahaf S. Shperberg, Ariel Felner, Nathan R. Sturtevant:
Front-to-End Bidirectional Heuristic Search with Consistent Heuristics: Enumerating and Evaluating Algorithms and Bounds. IJCAI 2023: 5631-5638 - [c146]Christopher Solinas, Douglas Rebstock, Nathan R. Sturtevant, Michael Buro:
History Filtering in Imperfect Information Games: Algorithms and Complexity. NeurIPS 2023 - [c145]Lior Siag, Shahaf S. Shperberg, Ariel Felner, Nathan R. Sturtevant:
Comparing Front-to-Front and Front-to-End Heuristics in Bidirectional Search. SOCS 2023: 158-162 - [i10]Christopher Solinas, Douglas Rebstock, Nathan R. Sturtevant, Michael Buro:
History Filtering in Imperfect Information Games: Algorithms and Complexity. CoRR abs/2311.14651 (2023) - [i9]Thayne T. Walker, Nathan R. Sturtevant, Ariel Felner:
Clique Analysis and Bypassing in Continuous-Time Conflict-Based Search. CoRR abs/2312.16106 (2023) - 2022
- [c144]Kristen K. Yu, Matthew Guzdial, Nathan R. Sturtevant, Morgan Cselinacz, Chris Corfe, Izzy Hubert Lyall, Chris Smith:
Adventures of AI Directors Early in the Development of Nightingale. AIIDE 2022: 70-77 - [c143]Kristen K. Yu, Matthew Guzdial, Nathan R. Sturtevant:
FarmQuest: A Demonstration of an AI Director Video Game Test Bed. AIIDE 2022: 288-290 - [c142]Shuli Hu, Daniel Damir Harabor, Graeme Gange, Peter J. Stuckey, Nathan R. Sturtevant:
Multi-Agent Path Finding with Temporal Jump Point Search. ICAPS 2022: 169-173 - [c141]Nathan R. Sturtevant:
An Efficient Chinese Checkers Implementation: Ranking, Bitboards, and BMI2 pext and pdep Instructions. CG 2022: 24-35 - [c140]Levi H. S. Lelis, João Gabriel Gama Vila Nova, Eugene Chen, Nathan R. Sturtevant, Carrie Demmans Epp, Michael Bowling:
Learning Curricula for Humans: An Empirical Study with Puzzles from The Witness. IJCAI 2022: 3877-3883 - [c139]Jasmeet Kaur, Nathan R. Sturtevant:
Efficient Budgeted Graph Search. IJCAI 2022: 4761-4768 - [c138]Tianhua Li, Ruimin Chen, Borislav Mavrin, Nathan R. Sturtevant, Doron Nadav, Ariel Felner:
Optimal Search with Neural Networks: Challenges and Approaches. SOCS 2022: 109-117 - 2021
- [c137]Jingwei Chen, Nathan R. Sturtevant:
Necessary and Sufficient Conditions for Avoiding Reopenings in Best First Suboptimal Search with General Bounding Functions. AAAI 2021: 3688-3696 - [c136]Matthew Guzdial, Nathan R. Sturtevant, Carolyn Yang:
The Impact of Visualizing Design Gradients for Human Designers. AIIDE 2021: 18-25 - [c135]Kristen K. Yu, Matthew Guzdial, Nathan R. Sturtevant:
The Definition-Context-Purpose Paradigm and Other Insights from Industry Professionals about the Definition of a Quest. AIIDE 2021: 107-114 - [c134]Shuli Hu, Daniel Damir Harabor, Graeme Gange, Peter J. Stuckey, Nathan R. Sturtevant:
Jump Point Search with Temporal Obstacles. ICAPS 2021: 184-191 - [c133]Shahaf S. Shperberg, Steven Danishevski, Ariel Felner, Nathan R. Sturtevant:
Iterative-deepening Bidirectional Heuristic Search with Restricted Memory. ICAPS 2021: 331-339 - [c132]Thayne T. Walker, Nathan R. Sturtevant, Ariel Felner, Han Zhang, Jiaoyang Li, T. K. Satish Kumar:
Conflict-Based Increasing Cost Search. ICAPS 2021: 385-395 - [c131]Kristen K. Yu, Nathan R. Sturtevant, Matthew Guzdial:
Towards Disambiguating Quests as a Technical Term. FDG 2021: 8:1-8:11 - [c130]Jingwei Chen, Nathan R. Sturtevant:
Avoiding Re-expansions in Suboptimal Best-First Search. SOCS 2021: 162-163 - [c129]Shahaf S. Shperberg, Steven Danishevski, Ariel Felner, Nathan R. Sturtevant:
Iterative-Deepening Bidirectional Heuristic Search with Restricted Memory. SOCS 2021: 194-196 - [i8]Matthew Guzdial, Nathan R. Sturtevant, Carolyn Yang:
The Impact of Visualizing Design Gradients for Human Designers. CoRR abs/2110.04147 (2021) - [i7]Kristen K. Yu, Matthew Guzdial, Nathan R. Sturtevant:
The Definition-Context-Purpose Paradigm and Other Insights from Industry Professionals About the Definition of a Quest. CoRR abs/2110.04148 (2021) - 2020
- [c128]Thayne T. Walker, Nathan R. Sturtevant, Ariel Felner:
Generalized and Sub-Optimal Bipartite Constraints for Conflict-Based Search. AAAI 2020: 7277-7284 - [c127]Nathan R. Sturtevant, Devon Sigurdson, Bjorn Taylor, Tim Gibson:
Abstraction and Refinement in Games with Dynamic Weighted Terrain. AAAI 2020: 13697-13699 - [c126]Nathan R. Sturtevant, Nicolas Decroocq, Aaron Tripodi, Matthew Guzdial:
The Unexpected Consequence of Incremental Design Changes. AIIDE 2020: 130-136 - [c125]Nathan R. Sturtevant, Nicolas Decroocq, Aaron Tripodi, Carolyn Yang, Matthew Guzdial:
A Demonstration of Anhinga: A Mixed-Initiative EPCG Tool for Snakebird. AIIDE 2020: 328-330 - [c124]Kristen K. Yu, Nathan R. Sturtevant, Matthew Guzdial:
What is a Quest? AIIDE Workshops 2020 - [c123]Dor Atzmon, Roni Stern, Ariel Felner, Nathan R. Sturtevant, Sven Koenig:
Probabilistic Robust Multi-Agent Path Finding. ICAPS 2020: 29-37 - [c122]Nathan R. Sturtevant, Shahaf S. Shperberg, Ariel Felner, Jingwei Chen:
Predicting the Effectiveness of Bidirectional Heuristic Search. ICAPS 2020: 281-290 - [c121]Dor Atzmon, Jiaoyang Li, Ariel Felner, Eliran Nachmani, Shahaf S. Shperberg, Nathan R. Sturtevant, Sven Koenig:
Multi-Directional Heuristic Search. IJCAI 2020: 4062-4068 - [c120]Shahaf S. Shperberg, Ariel Felner, Nathan R. Sturtevant, Solomon Eyal Shimony, Avi Hayoun:
Bidirectional Heuristic Search: Expanding Nodes by a Lower Bound. IJCAI 2020: 4775-4779 - [c119]Nathan R. Sturtevant, Malte Helmert:
A Guide to Budgeted Tree Search. SOCS 2020: 75-81 - [c118]Dor Atzmon, Jiaoyang Li, Ariel Felner, Eliran Nachmani, Shahaf S. Shperberg, Nathan R. Sturtevant, Sven Koenig:
Multi-Directional Search. SOCS 2020: 121-122
2010 – 2019
- 2019
- [j20]Tristan Cazenave, Abdallah Saffidine, Nathan R. Sturtevant:
Computer Games Workshop at IJCAI 2018. J. Int. Comput. Games Assoc. 41(2): 108-109 (2019) - [c117]Nathan R. Sturtevant:
Exploring EPCG in The Witness. KEG@AAAI 2019: 58-63 - [c116]Shahaf S. Shperberg, Ariel Felner, Nathan R. Sturtevant, Solomon Eyal Shimony, Avi Hayoun:
Enriching Non-Parametric Bidirectional Search Algorithms. AAAI 2019: 2379-2386 - [c115]Nathan R. Sturtevant:
On Strongly Solving Chinese Checkers. ACG 2019: 155-166 - [c114]Nathan R. Sturtevant, Devon Sigurdson, Bjorn Taylor, Tim Gibson:
Pathfinding and Abstraction with Dynamic Terrain Costs. AIIDE 2019: 80-86 - [c113]Douglas Rebstock, Christopher Solinas, Michael Buro, Nathan R. Sturtevant:
Policy Based Inference in Trick-Taking Card Games. CoG 2019: 1-8 - [c112]Kristen Yu, Nathan R. Sturtevant:
Application of Retrograde Analysis on Fighting Games. CoG 2019: 1-8 - [c111]Jingwei Chen, Nathan R. Sturtevant:
Conditions for Avoiding Node Re-expansions in Bounded Suboptimal Search. IJCAI 2019: 1220-1226 - [c110]Malte Helmert, Tor Lattimore, Levi H. S. Lelis, Laurent Orseau, Nathan R. Sturtevant:
Iterative Budgeted Exponential Search. IJCAI 2019: 1249-1257 - [c109]Shuli Hu, Nathan R. Sturtevant:
Direction-Optimizing Breadth-First Search with External Memory Storage. IJCAI 2019: 1258-1264 - [c108]Eshed Shaham, Ariel Felner, Nathan R. Sturtevant, Jeffrey S. Rosenschein:
Optimally Efficient Bidirectional Search. IJCAI 2019: 6221-6225 - [c107]Jingwei Chen, Nathan R. Sturtevant, William J. Doyle, Wheeler Ruml:
Revisiting Suboptimal Search. SOCS 2019: 18-25 - [c106]Shahaf S. Shperberg, Ariel Felner, Solomon Eyal Shimony, Nathan R. Sturtevant, Avi Hayoun:
Improving Bidirectional Heuristic Search by Bounds Propagation. SOCS 2019: 106-114 - [c105]Roni Stern, Nathan R. Sturtevant, Ariel Felner, Sven Koenig, Hang Ma, Thayne T. Walker, Jiaoyang Li, Dor Atzmon, Liron Cohen, T. K. Satish Kumar, Roman Barták, Eli Boyarski:
Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks. SOCS 2019: 151-158 - [c104]Shahaf S. Shperberg, Ariel Felner, Nathan R. Sturtevant, Solomon Eyal Shimony, Avi Hayoun:
Enriching Non-Parametric Bidirectional Search Algorithms - Extended Abstract. SOCS 2019: 196-197 - [c103]Thayne T. Walker, Nathan R. Sturtevant, Ariel Felner:
Unbounded Sub-Optimal Conflict-Based Search in Complex Domains. SOCS 2019: 204-205 - [e7]Tristan Cazenave, Abdallah Saffidine, Nathan R. Sturtevant:
Computer Games - 7th Workshop, CGW 2018, Held in Conjunction with the 27th International Conference on Artificial Intelligence, IJCAI 2018, Stockholm, Sweden, July 13, 2018, Revised Selected Papers. Communications in Computer and Information Science 1017, Springer 2019, ISBN 978-3-030-24336-4 [contents] - [i6]Douglas Rebstock, Christopher Solinas, Michael Buro, Nathan R. Sturtevant:
Policy Based Inference in Trick-Taking Card Games. CoRR abs/1905.10911 (2019) - [i5]Nathan R. Sturtevant, Malte Helmert:
Exponential-Binary State-Space Search. CoRR abs/1906.02912 (2019) - [i4]Roni Stern, Nathan R. Sturtevant, Ariel Felner, Sven Koenig, Hang Ma, Thayne T. Walker, Jiaoyang Li, Dor Atzmon, Liron Cohen, T. K. Satish Kumar, Eli Boyarski, Roman Barták:
Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks. CoRR abs/1906.08291 (2019) - [i3]Malte Helmert, Tor Lattimore, Levi H. S. Lelis, Laurent Orseau, Nathan R. Sturtevant:
Iterative Budgeted Exponential Search. CoRR abs/1907.13062 (2019) - 2018
- [j19]Nathan R. Sturtevant:
AI education matters: teaching search algorithms. AI Matters 4(3): 16-18 (2018) - [c102]Nathan R. Sturtevant, Ariel Felner:
A Brief History and Recent Achievements in Bidirectional Search. AAAI 2018: 8000-8007 - [c101]Nathan R. Sturtevant, Matheus Jun Ota:
Exhaustive and Semi-Exhaustive Procedural Content Generation. AIIDE 2018: 109-115 - [c100]Liron Cohen, Sven Koenig, T. K. Satish Kumar, Glenn Wagner, Howie Choset, David M. Chan, Nathan R. Sturtevant:
Rapid Randomized Restarts for Multi-Agent Path Finding: Preliminary Results. AAMAS 2018: 1909-1911 - [c99]Thayne T. Walker, Nathan R. Sturtevant, Ariel Felner:
Extended Increasing Cost Tree Search for Non-Unit Cost Domains. IJCAI 2018: 534-540 - [c98]Eshed Shaham, Ariel Felner, Nathan R. Sturtevant, Jeffrey S. Rosenschein:
Minimizing Node Expansions in Bidirectional Search with Consistent Heuristics. SOCS 2018: 81-89 - [c97]Daniel Brewer, Nathan R. Sturtevant:
Benchmarks for Pathfinding in 3D Voxel Space. SOCS 2018: 143-147 - [c96]Liron Cohen, Glenn Wagner, David M. Chan, Howie Choset, Nathan R. Sturtevant, Sven Koenig, T. K. Satish Kumar:
Rapid Randomized Restarts for Multi-Agent Path Finding Solvers. SOCS 2018: 148-152 - 2017
- [j18]Robert C. Holte, Ariel Felner, Guni Sharon, Nathan R. Sturtevant, Jingwei Chen:
MM: A bidirectional search algorithm that is guaranteed to meet in the middle. Artif. Intell. 252: 232-266 (2017) - [j17]Meir Goldenberg, Ariel Felner, Alon Palombo, Nathan R. Sturtevant, Jonathan Schaeffer:
The compressed differential heuristic. AI Commun. 30(6): 393-418 (2017) - [j16]Monica Anderson, Roman Barták, John S. Brownstein, David L. Buckeridge, Hoda Eldardiry, Christopher W. Geib, Maria L. Gini, Aaron Isaksen, Sarah Keren, Robert Laddaga, Viliam Lisý, Rodney Martin, David R. Martinez, Martin Michalowski, Loizos Michael, Reuth Mirsky, Thanh Hai Nguyen, Michael J. Paul, Enrico Pontelli, Scott Sanner, Arash Shaban-Nejad, Arunesh Sinha, Shirin Sohrabi, Kumar Sricharan, Biplav Srivastava, Mark Stefik, William W. Streilein, Nathan R. Sturtevant, Kartik Talamadupula, Michael Thielscher, Julian Togelius, Tran Cao Son, Long Tran-Thanh, Neal Wagner, Byron C. Wallace, Szymon Wilk, Jichen Zhu:
Reports of the Workshops of the Thirty-First AAAI Conference on Artificial Intelligence. AI Mag. 38(3): 72-82 (2017) - [c95]Nathan R. Sturtevant, Ariel Felner, Malte Helmert:
Value Compression of Pattern Databases. AAAI 2017: 912-918 - [c94]Nathan R. Sturtevant, Brian Magerko:
The State of the AIIDE Conference in 2017. AAAI 2017: 5079-5080 - [c93]Jürgen Eckerle, Jingwei Chen, Nathan R. Sturtevant, Sandra Zilles, Robert C. Holte:
Sufficient Conditions for Node Expansion in Bidirectional Heuristic Search. ICAPS 2017: 79-87 - [c92]Thayne T. Walker, David M. Chan, Nathan R. Sturtevant:
Using Hierarchical Constraints to Avoid Conflicts in Multi-Agent Pathfinding. ICAPS 2017: 316-324 - [c91]Nathan R. Sturtevant, Abdallah Saffidine:
A Study of Forward Versus Backwards Endgame Solvers with Results in Chinese Checkers. CGW@IJCAI 2017: 121-136 - [c90]Jingwei Chen, Robert C. Holte, Sandra Zilles, Nathan R. Sturtevant:
Front-to-End Bidirectional Heuristic Search with Near-Optimal Node Expansions. IJCAI 2017: 489-495 - [c89]Ariel Felner, Roni Stern, Solomon Eyal Shimony, Eli Boyarski, Meir Goldenberg, Guni Sharon, Nathan R. Sturtevant, Glenn Wagner, Pavel Surynek:
Search-Based Optimal Solvers for the Multi-Agent Pathfinding Problem: Summary and Challenges. SOCS 2017: 29-37 - [c88]Eshed Shaham, Ariel Felner, Jingwei Chen, Nathan R. Sturtevant:
The Minimal Set of States that Must Be Expanded in a Front-to-End Bidirectional Search. SOCS 2017: 82-90 - [c87]Malte Helmert, Nathan R. Sturtevant, Ariel Felner:
On Variable Dependencies and Compressed Pattern Databases. SOCS 2017: 129-133 - [i2]Jingwei Chen, Robert C. Holte, Sandra Zilles, Nathan R. Sturtevant:
Front-to-End Bidirectional Heuristic Search with Near-Optimal Node Expansions. CoRR abs/1703.03868 (2017) - 2016
- [j15]Nathan R. Sturtevant, Vadim Bulitko:
Scrubbing During Learning In Real-time Heuristic Search. J. Artif. Intell. Res. 57: 307-343 (2016) - [j14]Jochen Renz, Risto Miikkulainen, Nathan R. Sturtevant, Mark H. M. Winands:
Guest Editorial: Physics-Based Simulation Games. IEEE Trans. Comput. Intell. AI Games 8(2): 101-103 (2016) - [c86]Steve Rabin, Nathan R. Sturtevant:
Combining Bounding Boxes and JPS to Prune Grid Pathfinding. AAAI 2016: 746-752 - [c85]Robert C. Holte, Ariel Felner, Guni Sharon, Nathan R. Sturtevant:
Bidirectional Search That Is Guaranteed to Meet in the Middle. AAAI 2016: 3411-3417 - [c84]Nathan R. Sturtevant, Jingwei Chen:
External Memory Bidirectional Search. IJCAI 2016: 676-682 - [c83]Nathan R. Sturtevant, Steve Rabin:
Canonical Orderings on Grids. IJCAI 2016: 683-689 - [c82]Guni Sharon, Robert C. Holte, Ariel Felner, Nathan R. Sturtevant:
Extended Abstract: An Improved Priority Function for Bidirectional Heuristic Search. SOCS 2016: 139-140 - [c81]Nathan R. Sturtevant:
Generalizing JPS Symmetry Detection: Canonical Orderings on Graphs. SOCS 2016: 143-144 - [e6]Nathan R. Sturtevant, Brian Magerko:
Proceedings of the Twelfth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, AIIDE 2016, October 8-12, 2016, Burlingame, California, USA. AAAI Press 2016 [contents] - 2015
- [j13]Guni Sharon, Roni Stern, Ariel Felner, Nathan R. Sturtevant:
Conflict-based search for optimal multi-agent pathfinding. Artif. Intell. 219: 40-66 (2015) - [j12]Robert Morris, Blai Bonet, Marc Cavazza, Marie desJardins, Ariel Felner, Nick Hawes, Brad Knox, Sven Koenig, George Dimitri Konidaris, Jérôme Lang, Carlos Linares López, Daniele Magazzeni, Amy McGovern, Sriraam Natarajan, Nathan R. Sturtevant, Michael Thielscher, William Yeoh, Sebastian Sardiña, Kiri Wagstaff:
A Summary of the Twenty-Ninth AAAI Conference on Artificial Intelligence. AI Mag. 36(3): 99-106 (2015) - [c80]Nathan R. Sturtevant:
Challenges and Progress on Using Large Lossy Endgame Databases in Chinese Checkers. CGW/GIGA@IJCAI 2015: 3-15 - [c79]Nathan R. Sturtevant, Jason M. Traish, James R. Tulip, Tansel Uras, Sven Koenig, Ben Strasser, Adi Botea, Daniel Harabor, Steve Rabin:
The Grid-Based Path Planning Competition: 2014 Entries and Results. SOCS 2015: 241-250 - [e5]Arnav Jhala, Nathan R. Sturtevant:
Proceedings of the Eleventh AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, AIIDE 2015, November 14-18, 2015, University of California, Santa Cruz, CA, USA. AAAI Press 2015 [contents] - 2014
- [j11]Daniel Borrajo, Ariel Felner, Richard E. Korf, Maxim Likhachev, Carlos Linares López, Wheeler Ruml, Nathan R. Sturtevant:
The Fifth Annual Symposium on Combinatorial Search. AI Commun. 27(4): 327-328 (2014) - [j10]Nathan R. Sturtevant:
The Grid-Based Path Planning Competition. AI Mag. 35(3): 66-69 (2014) - [j9]Meir Goldenberg, Ariel Felner, Roni Stern, Guni Sharon, Nathan R. Sturtevant, Robert C. Holte, Jonathan Schaeffer:
Enhanced Partial Expansion A. J. Artif. Intell. Res. 50: 141-187 (2014) - [j8]Cameron Browne, Julian Togelius, Nathan R. Sturtevant:
Guest Editorial: General Games. IEEE Trans. Comput. Intell. AI Games 6(4): 317-319 (2014) - [c78]Guni Sharon, Ariel Felner, Nathan R. Sturtevant:
Exponential Deepening A* for Real-Time Agent-Centered Search. AAAI 2014: 871-877 - [c77]Richard Anthony Valenzano, Nathan R. Sturtevant, Jonathan Schaeffer:
Worst-Case Solution Quality Analysis When Not Re-Expanding Nodes in Best-First Search. AAAI 2014: 885-892 - [c76]Nathan R. Sturtevant, Jeff Orkin, Robert Zubek, Michael Cook, Stephen G. Ware, Christian Stith, Robert Michael Young, Phillip Wright, Squirrel (Brian) Eiserloh, Alejandro Ramirez-Sanabria, Vadim Bulitko, Kieran Lord:
Playable Experiences at AIIDE 2014. AIIDE 2014 - [c75]Richard Anthony Valenzano, Nathan R. Sturtevant, Jonathan Schaeffer, Fan Xie:
A Comparison of Knowledge-Based GBFS Enhancements and Knowledge-Free Exploration. ICAPS 2014 - [c74]Marc Lanctot, Mark H. M. Winands, Tom Pepels, Nathan R. Sturtevant:
Monte Carlo Tree Search with heuristic evaluations using implicit minimax backups. CIG 2014: 1-8 - [c73]Levi H. S. Lelis, Roni Stern, Nathan R. Sturtevant:
Estimating Search Tree Size with Duplicate Detection. SOCS 2014: 114-122 - [c72]Nathan R. Sturtevant, Vadim Bulitko:
Reaching the Goal in Real-Time Heuristic Search: Scrubbing Behavior is Unavoidable. SOCS 2014: 166-174 - [c71]Nathan R. Sturtevant, Ariel Felner, Malte Helmert:
Exploiting the Rubik's Cube 12-Edge PDB by Combining Partial Pattern Databases and Bloom Filters. SOCS 2014: 175-183 - [c70]Guni Sharon, Ariel Felner, Nathan R. Sturtevant:
Exponential Deepening A* for Real-Time Agent-Centered Search. SOCS 2014: 209-210 - [i1]Marc Lanctot, Mark H. M. Winands, Tom Pepels, Nathan R. Sturtevant:
Monte Carlo Tree Search with Heuristic Evaluations using Implicit Minimax Backups. CoRR abs/1406.0486 (2014) - 2013
- [c69]Guni Sharon, Ariel Felner, Roni Stern, Nathan R. Sturtevant:
Partial Domain Search Tree For Constraint-Satisfaction Problems. AAAI (Late-Breaking Developments) 2013 - [c68]Nathan R. Sturtevant:
Incorporating Human Relationships Into Path Planning. AIIDE 2013 - [c67]Nathan R. Sturtevant:
An Argument for Large-Scale Breadth-First Search for Game Design and Content Generation via a Case Study of Fling! AI in the Game Design Process @ AIIDE 2013 - [c66]Richard Anthony Valenzano, Shahab Jabbari Arfaee, Jordan Tyler Thayer, Roni Stern, Nathan R. Sturtevant:
Using Alternative Suboptimality Bounds in Heuristic Search. ICAPS 2013 - [c65]Duane Szafron, Richard G. Gibson, Nathan R. Sturtevant:
A parameterized family of equilibrium profiles for three-player kuhn poker. AAMAS 2013: 247-254 - [c64]Max Roschke, Nathan R. Sturtevant:
UCT Enhancements in Chinese Checkers Using an Endgame Database. CGW@IJCAI 2013: 57-70 - [c63]D. Chris Rayner, Nathan R. Sturtevant, Michael Bowling:
Subset Selection of Search Heuristics. IJCAI 2013: 637-643 - [c62]Nathan R. Sturtevant, Matthew J. Rutherford:
Minimizing Writes in Parallel External Memory Search. IJCAI 2013: 666-673 - [c61]Nathan R. Sturtevant:
External Memory PDBs: Initial Results. SARA 2013 - [c60]Meir Goldenberg, Ariel Felner, Nathan R. Sturtevant, Robert C. Holte, Jonathan Schaeffer:
Optimal-Generation Variants of EPEA. SOCS 2013: 89-97 - [c59]Guni Sharon, Nathan R. Sturtevant, Ariel Felner:
Online Detection of Dead States in Real-Time Agent-Centered Search. SOCS 2013: 167-174 - [c58]Faten Aljalaud, Nathan R. Sturtevant:
Finding Bounded Suboptimal Multi-Agent Path Planning Solutions Using Increasing Cost Tree Search (Extended Abstract). SOCS 2013: 203-204 - [e4]Rachel McDonnell, Nathan R. Sturtevant, Victor B. Zordan:
Motion in Games, MIG '13, Dublin, Ireland, November 6-8, 2013. ACM 2013, ISBN 978-1-4503-2546-2 [contents] - 2012
- [j7]Vadim Bulitko, Mark O. Riedl, Arnav Jhala, Michael Buro, Nathan R. Sturtevant:
Recap of the Seventh AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment (AIIDE). AI Mag. 33(1): 51-54 (2012) - [j6]Vikas Agrawal, Jorge A. Baier, Kostas E. Bekris, Yiling Chen, Artur S. d'Avila Garcez, Pascal Hitzler, Patrik Haslum, Dietmar Jannach, Edith Law, Freddy Lécué, Luís C. Lamb, Cynthia Matuszek, Héctor Palacios, Biplav Srivastava, Lokendra Shastri, Nathan R. Sturtevant, Roni Stern, Stefanie Tellex, Stavros Vassos:
Reports of the AAAI 2012 Conference Workshops. AI Mag. 33(4): 119- (2012) - [j5]Nathan R. Sturtevant:
Benchmarks for Grid-Based Pathfinding. IEEE Trans. Comput. Intell. AI Games 4(2): 144-148 (2012) - [c57]Ariel Felner, Meir Goldenberg, Guni Sharon, Roni Stern, Tal Beja, Nathan R. Sturtevant, Jonathan Schaeffer, Robert Holte:
Partial-Expansion A* with Selective Node Generation. AAAI 2012: 471-477 - [c56]Guni Sharon, Roni Stern, Ariel Felner, Nathan R. Sturtevant:
Conflict-Based Search For Optimal Multi-Agent Path Finding. AAAI 2012: 563-569 - [c55]Guni Sharon, Roni Stern, Ariel Felner, Nathan R. Sturtevant:
Conflict-Based Search for Optimal Multi-Agent Path Finding. MAPF@AAAI 2012 - [c54]Nathan R. Sturtevant, Ariel Felner, Maxim Likhachev, Wheeler Ruml:
Heuristic Search Comes of Age. AAAI 2012: 2186-2191 - [c53]Richard Anthony Valenzano, Hootan Nakhost, Martin Müller, Jonathan Schaeffer, Nathan R. Sturtevant:
ArvandHerd: Parallel Planning with a Portfolio. ECAI 2012: 786-791 - [c52]Nathan R. Sturtevant:
Moving Path Planning Forward. MIG 2012: 1-6 - [c51]Guni Sharon, Roni Stern, Ariel Felner, Nathan R. Sturtevant:
Meta-Agent Conflict-Based Search For Optimal Multi-Agent Path Finding. SOCS 2012: 97-104 - [c50]Ariel Felner, Meir Goldenberg, Guni Sharon, Roni Stern, Tal Beja, Nathan R. Sturtevant, Robert Holte, Jonathan Schaeffer:
Partial-Expansion A* with Selective Node Generation. SOCS 2012: 180-181 - [c49]Guni Sharon, Roni Stern, Ariel Felner, Nathan R. Sturtevant:
Conflict-Based Search for Optimal Multi-Agent Path Finding. SOCS 2012: 190 - [e3]Ariel Felner, Nathan R. Sturtevant, Kostas E. Bekris, Roni Stern:
Multiagent Pathfinding, Papers from the 2012 AAAI Workshop, MAPF@AAAI 2012, Toronto, Ontario, Canada, July 22, 2012. AAAI Technical Report WS-12-10, AAAI Press 2012, ISBN 978-1-57735-575-5 [contents] - [e2]Daniel Borrajo, Ariel Felner, Richard E. Korf, Maxim Likhachev, Carlos Linares López, Wheeler Ruml, Nathan R. Sturtevant:
Proceedings of the Fifth Annual Symposium on Combinatorial Search, SOCS 2012, Niagara Falls, Ontario, Canada, July 19-21, 2012. AAAI Press 2012 [contents] - 2011
- [j4]Ariel Felner, Uzi Zahavi, Robert Holte, Jonathan Schaeffer, Nathan R. Sturtevant, Zhifu Zhang:
Inconsistent heuristics in theory and practice. Artif. Intell. 175(9-10): 1570-1603 (2011) - [j3]Mesut Kirci, Nathan R. Sturtevant, Jonathan Schaeffer:
A GGP Feature Learning Algorithm. Künstliche Intell. 25(1): 35-42 (2011) - [c48]Meir Goldenberg, Nathan R. Sturtevant, Ariel Felner, Jonathan Schaeffer:
The Compressed Differential Heuristic. AAAI 2011: 24-29 - [c47]D. Chris Rayner, Michael H. Bowling, Nathan R. Sturtevant:
Euclidean Heuristic Optimization. AAAI 2011: 81-86 - [c46]Matthew Church, Eric Graves, Jason Duncan, Adel Lari, Robin Miller, Neesha Desai, Richard Zhao, Mike Carbonaro, Jonathan Schaeffer, Nathan R. Sturtevant, Duane Szafron:
A Demonstration of ScriptEase II. AIIDE 2011 - [c45]Nathan R. Sturtevant:
A Sparse Grid Representation for Dynamic Three-Dimensional Worlds. AIIDE 2011 - [c44]Greg Ashe, Nathan R. Sturtevant, Jong-Hwan Kim:
Keynotes: Data mining and machine learning applications in MMOs. CIG 2011 - [c43]Nathan R. Sturtevant, Vadim Bulitko:
Learning Where You Are Going and from Whence You Came: h- and g-Cost Learning in Real-Time Heuristic Search. IJCAI 2011: 365-370 - [c42]Mokhtar M. Khorshid, Robert C. Holte, Nathan R. Sturtevant:
A Polynomial-Time Algorithm for Non-Optimal Multi-Agent Pathfinding. SOCS 2011: 76-83 - [c41]Meir Goldenberg, Nathan R. Sturtevant, Ariel Felner, Jonathan Schaeffer:
The Compressed Differential Heuristic. SOCS 2011: 191-192 - [c40]Nathan R. Sturtevant:
Distance Learning in Agent-Centered Heuristic Search. SOCS 2011: 207-208 - 2010
- [c39]Ariel Felner, Carsten Moldenhauer, Nathan R. Sturtevant, Jonathan Schaeffer:
Single-Frontier Bidirectional Search. AAAI 2010: 59-64 - [c38]Jeffrey Richard Long, Nathan R. Sturtevant, Michael Buro, Timothy Furtak:
Understanding the Success of Perfect Information Monte Carlo Sampling in Game Tree Search. AAAI 2010: 134-140 - [c37]Nathan R. Sturtevant, Robert Geisberger:
A Comparison of High-Level Approaches for Speeding Up Pathfinding. AIIDE 2010 - [c36]Richard Anthony Valenzano, Nathan R. Sturtevant, Jonathan Schaeffer, Karen Buro, Akihiro Kishimoto:
Simultaneously Searching with Multiple Settings: An Alternative to Parameter Tuning for Suboptimal Single-Agent Search Algorithms. ICAPS 2010: 177-184 - [c35]Nathan R. Sturtevant, Vadim Bulitko, Yngvi Björnsson:
On learning in agent-centered search. AAMAS 2010: 333-340 - [c34]Daniel Wong, Darren Earl, Fred Zyda, Ryan Zink, Sven Koenig, Allen Pan, Selby Shlosberg, Jaspreet Singh, Nathan R. Sturtevant:
Implementing games on pinball machines. FDG 2010: 240-247 - [c33]Meir Goldenberg, Ariel Felner, Nathan R. Sturtevant, Jonathan Schaeffer:
Portal-Based True-Distance Heuristics for Path Finding. SOCS 2010: 39-45 - [c32]Carsten Moldenhauer, Ariel Felner, Nathan R. Sturtevant, Jonathan Schaeffer:
Single-Frontier Bidirectional Search. SOCS 2010: 151-152 - [c31]Richard Anthony Valenzano, Nathan R. Sturtevant, Jonathan Schaeffer, Karen Buro, Akihiro Kishimoto:
Simultaneously Searching with Multiple Settings: An Alternative to Parameter Tuning for Suboptimal Single-Agent Search Algorithms. SOCS 2010: 157-158 - [e1]Ariel Felner, Nathan R. Sturtevant:
Proceedings of the Third Annual Symposium on Combinatorial Search, SOCS 2010, Stone Mountain, Atlanta, Georgia, USA, July 8-10, 2010. AAAI Press 2010 [contents]
2000 – 2009
- 2009
- [c30]Nathan R. Sturtevant:
Optimizing Motion-Constrained Pathfinding. AIIDE 2009 - [c29]Carsten Moldenhauer, Nathan R. Sturtevant:
Optimal solutions for moving target search. AAMAS (2) 2009: 1249-1250 - [c28]Barnabás Póczos, Yasin Abbasi-Yadkori, Csaba Szepesvári, Russell Greiner, Nathan R. Sturtevant:
Learning when to stop thinking and do something! ICML 2009: 825-832 - [c27]Yngvi Björnsson, Vadim Bulitko, Nathan R. Sturtevant:
TBA*: Time-Bounded A*. IJCAI 2009: 431-436 - [c26]Carsten Moldenhauer, Nathan R. Sturtevant:
Evaluating Strategies for Running from the Cops. IJCAI 2009: 584-589 - [c25]Nathan R. Sturtevant, Ariel Felner, Max Barer, Jonathan Schaeffer, Neil Burch:
Memory-Based Heuristics for Explicit State Spaces. IJCAI 2009: 609-614 - [c24]Zhifu Zhang, Nathan R. Sturtevant, Robert C. Holte, Jonathan Schaeffer, Ariel Felner:
A* Search with Inconsistent Heuristics. IJCAI 2009: 634-639 - [c23]Michael Buro, Jeffrey Richard Long, Timothy Furtak, Nathan R. Sturtevant:
Improving State Evaluation, Inference, and Search in Trick-Based Card Games. IJCAI 2009: 1407-1413 - [c22]Ariel Felner, Nathan R. Sturtevant:
Abstraction-Based Heuristics with True Distance Computations. SARA 2009 - 2008
- [j2]Nathan R. Sturtevant:
An Analysis of UCT in Multi-Player Games. J. Int. Comput. Games Assoc. 31(4): 195-208 (2008) - [c21]M. Renee Jansen, Nathan R. Sturtevant:
Direction Maps for Cooperative Pathfinding. AIIDE 2008 - [c20]M. Renee Jansen, Nathan R. Sturtevant:
A new approach to cooperative pathfinding. AAMAS (3) 2008: 1401-1404 - [c19]Akihiro Kishimoto, Nathan R. Sturtevant:
Optimized algorithms for multi-agent routing. AAMAS (3) 2008: 1585-1588 - [c18]Nathan R. Sturtevant:
An Analysis of UCT in Multi-player Games. Computers and Games 2008: 37-49 - [c17]Nathan R. Sturtevant, H. James Hoover, Jonathan Schaeffer, Sean Gouglas, Michael H. Bowling, Finnegan Southey, Matthew Bouchard, Ghassan Zabaneh:
Multidisciplinary students and instructors: a second-year games course. SIGCSE 2008: 383-387 - 2007
- [j1]Vadim Bulitko, Nathan R. Sturtevant, Jieshan Lu, Timothy Yau:
Graph Abstraction in Real-time Heuristic Search. J. Artif. Intell. Res. 30: 51-100 (2007) - [c16]Uzi Zahavi, Ariel Felner, Jonathan Schaeffer, Nathan R. Sturtevant:
Inconsistent Heuristics. AAAI 2007: 1211-1216 - [c15]Nathan R. Sturtevant:
Memory-Efficient Abstractions for Pathfinding. AIIDE 2007: 31-36 - [c14]Nathan R. Sturtevant, M. Renee Jansen:
An Analysis of Map-Based Abstraction and Refinement. SARA 2007: 344-358 - 2006
- [c13]Nathan R. Sturtevant, Martin Zinkevich, Michael H. Bowling:
Prob-Maxn: Playing N-Player Games with Opponent Models. AAAI 2006: 1057-1063 - [c12]Yngvi Björnsson, Jonathan Schaeffer, Nathan R. Sturtevant:
Partial Information Endgame Databases. ACG 2006: 11-22 - [c11]Nathan R. Sturtevant, Michael Buro:
Improving Collaborative Pathfinding Using Map Abstraction. AIIDE 2006: 80-85 - [c10]Nathan R. Sturtevant, Michael H. Bowling:
Robust game play against unknown opponents. AAMAS 2006: 713-719 - [c9]Nathan R. Sturtevant, Adam M. White:
Feature Construction for Reinforcement Learning in Hearts. Computers and Games 2006: 122-134 - 2005
- [c8]Vadim Bulitko, Nathan R. Sturtevant, Maryia Kazakevich:
Speeding Up Learning in Real-time Search via Automatic State Abstraction. AAAI 2005: 1349-1354 - [c7]Nathan R. Sturtevant, Michael Buro:
Partial Pathfinding Using Map Abstraction and Refinement. AAAI 2005: 1392-1397 - [c6]Nathan R. Sturtevant:
Leaf-Value Tables for Pruning Non-Zero-Sum Games. IJCAI 2005: 317-323 - [c5]Nathan R. Sturtevant, Vadim Bulitko, Michael Buro:
Automatic State Abstraction for Pathfinding in Real-Time Video Games. SARA 2005: 362-364 - 2004
- [c4]Nathan R. Sturtevant:
Current Challenges in Multi-player Game Search. Computers and Games 2004: 285-300 - 2003
- [c3]Nathan R. Sturtevant:
Last-Branch and Speculative Pruning Algorithms for Maxn. IJCAI 2003: 669-678 - 2002
- [c2]Nathan R. Sturtevant:
A Comparison of Algorithms for Multi-player Games. Computers and Games 2002: 108-122 - 2000
- [c1]Nathan R. Sturtevant, Richard E. Korf:
On Pruning Techniques for Multi-Player Games. AAAI/IAAI 2000: 201-207
Coauthor Index
[c159] [c158] [c155] [c154] [c153] [j21] [c149] [c147] [c145] [i9] [c138] [c133] [c132] [c129] [c128] [c123] [c122] [c121] [c120] [c118] [c116] [c108] [c106] [c105] [c104] [c103] [i4] [c102] [c99] [c98] [j18] [j17] [c95] [c89] [c88] [c87] [c85] [c82] [j13] [j12] [j11] [j9] [c78] [c71] [c70] [c69] [c60] [c59] [c57] [c56] [c55] [c54] [c51] [c50] [c49] [e3] [e2] [j4] [c48] [c41] [c39] [c33] [c32] [e1] [c25] [c24] [c22] [c16]
Robert C. Holte
aka: Robert Holte
aka: Robert Holte
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-28 21:15 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
