default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThayne T. Walker
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c9]Thayne T. Walker, Nathan R. Sturtevant, Ariel Felner:
Clique Analysis and Bypassing in Continuous-Time Conflict-Based Search. AAMAS 2024: 2540-2542- [c8]Thayne T. Walker, Nathan R. Sturtevant, Ariel Felner:
Clique Analysis and Bypassing in Continuous-Time Conflict-Based Search. SOCS 2024: 152-160 - [i4]Thayne T. Walker, Nathan R. Sturtevant:
On the Completeness of Conflict-Based Search: Temporally-Relative Duplicate Pruning. CoRR abs/2408.09028 (2024) - 2023
- [j1]Adrian P. Pope
, Jaime S. Ide, Daria Micovic, Henry Díaz, Jason C. Twedt, Kevin Alcedo, Thayne T. Walker, David Rosenbluth, Lee Ritholtz, Daniel Javorsek:
Hierarchical Reinforcement Learning for Air Combat at DARPA's AlphaDogfight Trials. IEEE Trans. Artif. Intell. 4(6): 1371-1385 (2023) - [c7]Thayne T. Walker, Jaime S. Ide, Minkyu Choi, Michael J. Guarino, Kevin Alcedo:
Multi-Agent Reinforcement Learning with Epistemic Priors. CoDIT 2023: 2514-2518 - [i3]Thayne T. Walker, Nathan R. Sturtevant, Ariel Felner:
Clique Analysis and Bypassing in Continuous-Time Conflict-Based Search. CoRR abs/2312.16106 (2023) - 2021
- [c6]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 - [i2]Adrian P. Pope, Jaime S. Ide, Daria Micovic, Henry Díaz, David Rosenbluth, Lee Ritholtz, Jason C. Twedt, Thayne T. Walker, Kevin Alcedo, Daniel Javorsek:
Hierarchical Reinforcement Learning for Air-to-Air Combat. CoRR abs/2105.00990 (2021) - 2020
- [c5]Thayne T. Walker, Nathan R. Sturtevant, Ariel Felner:
Generalized and Sub-Optimal Bipartite Constraints for Conflict-Based Search. AAAI 2020: 7277-7284
2010 – 2019
- 2019
- [c4]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 - [c3]Thayne T. Walker, Nathan R. Sturtevant, Ariel Felner:
Unbounded Sub-Optimal Conflict-Based Search in Complex Domains. SOCS 2019: 204-205 - [i1]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) - 2018
- [c2]Thayne T. Walker, Nathan R. Sturtevant, Ariel Felner:
Extended Increasing Cost Tree Search for Non-Unit Cost Domains. IJCAI 2018: 534-540 - 2017
- [c1]Thayne T. Walker, David M. Chan, Nathan R. Sturtevant:
Using Hierarchical Constraints to Avoid Conflicts in Multi-Agent Pathfinding. ICAPS 2017: 316-324
Coauthor Index
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-09-26 01:56 CEST 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:
