Back to Results
First PageMeta Content
Admissible heuristic / Heuristic / Heuristics / Heuristic function / Automated planning and scheduling


A Normal Form for Classical Planning Tasks Florian Pommerening and Malte Helmert University of Basel Basel, Switzerland {florian.pommerening,malte.helmert}@unibas.ch
Add to Reading List

Document Date: 2015-04-01 08:50:48

Open Document

File Size: 184,96 KB

Share Result on Facebook

Company

unrestricted LP / IOS Press / Multi-Agent Systems / AAAI Press / M&S / /

Country

Switzerland / United States / /

/

Facility

University of Basel / Malte Helmert University of Basel Basel / University of Wisconsin / /

IndustryTerm

backward search / heuristic search / regression search / feasible solution / abstract transition systems / search nodes / forward search / perimeter search / search-based planning algorithms / state-space search / search topology / attractive tool / search algorithms / /

Organization

University of Basel / Classical Planning Tasks Florian Pommerening and Malte Helmert University of Basel Basel / Department of Mathematics and Computer Science / Artificial Copyright Intelligence / Association for the Advancement / University of Wisconsin / Madison / Swiss National Science Foundation / Computer Science Department / /

Person

References Alc´azar / V / /

Position

LAMA planner / planning researcher / /

ProvinceOrState

Wisconsin / /

PublishedMedium

Journal of the ACM / Journal of Artificial Intelligence Research / Lecture Notes in Computer Science / /

Technology

search-based planning algorithms / artificial intelligence / search algorithms / dom / /

URL

www.aaai.org / /

SocialTag