default search action
Vikas Shivashankar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c12]Taoan Huang, Vikas Shivashankar, Michael Caldara, Joseph W. Durham, Jiaoyang Li, Bistra Dilkina, Sven Koenig:
Deadline-Aware Multi-Agent Tour Planning. ICAPS 2023: 189-197 - 2021
- [j2]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)
2010 – 2019
- 2018
- [j1]Patrik Haslum, Franc Ivankovic, Miquel Ramírez
, Dan Gordon
, Sylvie Thiébaux, Vikas Shivashankar, Dana S. Nau:
Extending Classical Planning with State Constraints: Heuristics and Search for Optimal Planning. J. Artif. Intell. Res. 62: 373-431 (2018) - 2017
- [c11]Vikas Shivashankar, Ron Alford, David W. Aha:
Incorporating Domain-Independent Planning Heuristics in Hierarchical Planning. AAAI 2017: 3658-3664 - 2016
- [c10]Vikas Shivashankar, Ron Alford, Mark Roberts, David W. Aha
:
Cost-Optimal Algorithms for Planning with Procedural Control Knowledge. ECAI 2016: 1702-1703 - [c9]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 - [i1]Vikas Shivashankar, Ron Alford, Mark Roberts, David W. Aha:
Cost-Optimal Algorithms for Planning with Procedural Control Knowledge. CoRR abs/1607.01729 (2016) - 2015
- [b1]Vikas Shivashankar:
Hierarchical Goal Networks: Formalisms and Algorithms for Planning and Acting. University of Maryland, College Park, MD, USA, 2015 - 2014
- [c8]Vikas Shivashankar, Krishnanand N. Kaipa, Dana S. Nau, Satyandra K. Gupta:
Towards Integrating Hierarchical Goal Networks and Motion Planners to Support Planning for Human Robot Collaboration in Assembly Cells. AAAI Fall Symposia 2014 - [c7]Ronald Alford, Vikas Shivashankar, Ugur Kuter, Dana S. Nau:
On the Feasibility of Planning Graph Style Heuristics for HTN Planning. ICAPS 2014 - [c6]Franc Ivankovic, Patrik Haslum, Sylvie Thiébaux, Vikas Shivashankar, Dana S. Nau:
Optimal Planning with Global Numerical State Constraints. 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 - 2011
- [c2]Vikas Shivashankar, Rajiv Jain, Ugur Kuter, Dana S. Nau:
Real-Time Planning for Covering an Initially-Unknown Spatial Environment. FLAIRS 2011 - 2010
- [c1]Peter Struss, Vikas Shivashankar, Mohamed Zahoor:
A Fault-model-based Debugging Aid for Data Warehouse Applications. ECAI 2010: 419-424
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 2025-03-04 21:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint