Efficient, Safe, and Probably Approximately Complete Learning of Action Models

STRIPS: A new approach to the application of theorem proving to problem solving

Richard E Fikes and Nils J Nilsson · 1971

Earlier work this paper cites.

On the uniform convergence of relative frequencies of events to their probabilities

V. Vapnik and A. Chervonenkis · 1971

Earlier work this paper cites.

A theory of the learnable

Leslie G. Valiant · 1984

Earlier work this paper cites.

Cryptographic limitations on learning boolean formulae and finite automata

Michael Kearns and Leslie Valiant · 1994

Earlier work this paper cites.

Memoryless policies: Theoretical limitations and practical results

Michael L. Littman · 1994

Earlier work this paper cites.

Learning planning operators by observation and practice

Xuemei Wang · 1994

Earlier work this paper cites.

Complexity results for SAS+ planning

Christer Bäckström and Bernhard Nebel · 1995

Earlier work this paper cites.

Learning by observation and practice: An incremental approach for planning operator acquisition

Xuemei Wang · 1995

Cited alongside, same era.

PDDL-the planning domain definition language

Drew McDermott, Malik Ghallab, Adele Howe, Craig Knoblock, Ashwin Ram, Manuela Veloso, Daniel Weld, and David Wilkins · 1998

Cited alongside, same era.

Solving POMDPs by searching the space of finite policies

Nicolas Meuleau, Kee-Eung Kim, Leslie Pack Kaelbling, and Anthony R. Cassandra · 1999

Cited alongside, same era.

On the compilability and expressive power of propositional planning formalisms

Bernhard Nebel · 2000

Cited alongside, same era.

A sparse sampling algorithm for near-optimal planning in large Markov decision processes

Michael Kearns, Yishay Mansour, and Andrew Ng · 2002

Cited alongside, same era.

On the sample complexity of reinforcement learning

Sham M. Kakade · 2003

Nanorobot architecture for medical target identification

Adriano Cavalcanti, Bijan Shirinzadeh, Robert A Freitas Jr, and Tad Hogg · 2007

Later among the works it cites.

Learning action models from plan examples using weighted MAX-SAT

Qiang Yang, Kangheng Wu, and Yunfei Jiang · 2007

Later among the works it cites.

Efficient learning of action schemas and web-service descriptions

Thomas J. Walsh and Michael L. Littman · 2008

Later among the works it cites.

Learning STRIPS operators from noisy and incomplete observations

Kira Mourão, Luke S Zettlemoyer, Ronald Petrick, and Mark Steedman · 2012

Later among the works it cites.

Acquiring planning domain models using LOCM

Stephen N. Cresswell, Thomas L. McCluskey, and Margaret M. West · 2013

Later among the works it cites.

Integrating planning, execution, and learning to improve plan execution

Sergio Jiménez, Fernando Fernández, and Daniel Borrajo · 2013