default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRon Alford
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2013
[b1]Ronald Alford:
Search Complexities for HTN Planning. University of Maryland, College Park, MD, USA, 2013
Journal Articles
- 2024
- [j4]Ayal Taitler
, Ron Alford, Joan Espasa, Gregor Behnke, Daniel Fiser, Michael Gimelfarb, Florian Pommerening, Scott Sanner, Enrico Scala, Dominik Schreiber, Javier Segovia-Aguas, Jendrik Seipp:
The 2023 International Planning Competition. AI Mag. 45(2): 280-296 (2024) - 2021
- [j3]Pascal Bercher, Daniel Höller, Gregor Behnke, Susanne Biundo, Vikas Shivashankar, Ron Alford:
Report on the First and Second Workshops on Hierarchical Planning Held at the International Conference on Automated Planning and Scheduling. AI Mag. 42(1): 83-85 (2021) - 2016
- [j2]Ronald Alford:
Search Complexities for HTN Planning. Künstliche Intell. 30(1): 99-100 (2016) - 2014
- [j1]Ronald Alford, Ugur Kuter, Dana S. Nau, Robert P. Goldman:
Plan aggregation for strong cyclic planning in nondeterministic domains. Artif. Intell. 216: 206-232 (2014)
Conference and Workshop Papers
- 2022
- [c20]Gregor Behnke, Florian Pollitt, Daniel Höller, Pascal Bercher, Ron Alford:
Making Translations to Classical Planning Competitive with Other HTN Planners. AAAI 2022: 9687-9697 - [c19]Ron Alford, Lukás Chrpa, Mauro Vallati, Andy Applebaum:
Knowledge Reformulation and Deception as a Defense Against Automated Cyber Adversaries. FLAIRS 2022 - [c18]Pascal Bercher, Songtuan Lin, Ron Alford:
Tight Bounds for Hybrid Planning. IJCAI 2022: 4597-4605 - 2020
- [c17]Daniel Höller, Gregor Behnke, Pascal Bercher, Susanne Biundo, Humbert Fiorino, Damien Pellier, Ron Alford:
HDDL: An Extension to PDDL for Expressing Hierarchical Planning Problems. AAAI 2020: 9883-9891 - 2019
- [c16]Pascal Bercher, Ron Alford, Daniel Höller:
A Survey on Hierarchical Planning - One Abstract Idea, Many Concrete Realizations. IJCAI 2019: 6267-6275 - 2017
- [c15]Vikas Shivashankar, Ron Alford, David W. Aha:
Incorporating Domain-Independent Planning Heuristics in Hierarchical Planning. AAAI 2017: 3658-3664 - 2016
- [c14]Ron Alford, Gregor Behnke, Daniel Höller, Pascal Bercher, Susanne Biundo, David W. Aha:
Bound to Plan: Exploiting Classical Heuristics via Automatic Translations of Tail-Recursive HTN Problems. ICAPS 2016: 20-28 - [c13]Vikas Shivashankar, Ron Alford, Mark Roberts, David W. Aha:
Cost-Optimal Algorithms for Planning with Procedural Control Knowledge. ECAI 2016: 1702-1703 - [c12]Ron Alford, Vikas Shivashankar, Mark Roberts, Jeremy Frank, David W. Aha:
Hierarchical Planning: Relating Task and Goal Decomposition with Task Sharing. IJCAI 2016: 3022-3029 - 2015
- [c11]Ron Alford, Pascal Bercher, David W. Aha:
Tight Bounds for HTN Planning. ICAPS 2015: 7-15 - [c10]Hayley Borck, Justin Karneeb, Ron Alford, David W. Aha:
Case-Based Behavior Recognition in Beyond Visual Range Air Combat. FLAIRS 2015: 379-384 - [c9]Hayley Borck, Justin Karneeb, Michael W. Floyd, Ron Alford, David W. Aha:
Case-Based Policy and Goal Recognition. ICCBR 2015: 30-43 - [c8]Ron Alford, Pascal Bercher, David W. Aha:
Tight Bounds for HTN Planning with Task Insertion. IJCAI 2015: 1502-1508 - [c7]Ron Alford, Pascal Bercher, David W. Aha:
Tight Bounds for HTN Planning with Task Insertion (Extended Abstract). SOCS 2015: 221-222 - 2014
- [c6]Ronald Alford, Vikas Shivashankar, Ugur Kuter, Dana S. Nau:
On the Feasibility of Planning Graph Style Heuristics for HTN Planning. ICAPS 2014 - 2013
- [c5]Vikas Shivashankar, Ronald Alford, Ugur Kuter, Dana S. Nau:
The GoDeL Planning System: A More Perfect Union of Domain-Independent and Hierarchical Planning. IJCAI 2013: 2380-2386 - 2012
- [c4]Vikas Shivashankar, Ugur Kuter, Dana S. Nau, Ronald Alford:
A hierarchical goal-based formalism and algorithm for single-agent planning. AAMAS 2012: 981-988 - [c3]Ronald Alford, Vikas Shivashankar, Ugur Kuter, Dana S. Nau:
HTN Problem Spaces: Structure, Algorithms, Termination. SOCS 2012: 2-9 - 2009
- [c2]Ronald Alford, Ugur Kuter, Dana S. Nau, Elnatan Reisner, Robert P. Goldman:
Maintaining Focus: Overcoming Attention Deficit Disorder in Contingent Planning. FLAIRS 2009 - [c1]Ronald Alford, Ugur Kuter, Dana S. Nau:
Translating HTNs to PDDL: A Small Amount of Domain Knowledge Can Go a Long Way. IJCAI 2009: 1629-1634
Informal and Other Publications
- 2021
- [i4]Ron Alford, Andy Applebaum:
Towards Causal Models for Adversary Distractions. CoRR abs/2104.10575 (2021) - 2019
- [i3]Daniel Höller, Gregor Behnke, Pascal Bercher, Susanne Biundo, Humbert Fiorino, Damien Pellier, Ronald Alford:
Hierarchical Planning in the IPC. CoRR abs/1909.04405 (2019) - [i2]Daniel Höller, Gregor Behnke, Pascal Bercher, Susanne Biundo, Humbert Fiorino, Damien Pellier, Ronald Alford:
HDDL - A Language to Describe Hierarchical Planning Problems. CoRR abs/1911.05499 (2019) - 2016
- [i1]Vikas Shivashankar, Ron Alford, Mark Roberts, David W. Aha:
Cost-Optimal Algorithms for Planning with Procedural Control Knowledge. CoRR abs/1607.01729 (2016)
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-08-14 23:17 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:
