EFFICIENTLY FINDING (NEARLY) MINIMAL FST OF REPETITIVE UNSEGMENTED DEMONSTRATION DATA

Frederick L. Crabbe

Research.Publish.Connect.

*Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search *Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search *Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search *Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Paper

EFFICIENTLY FINDING (NEARLY) MINIMAL FST OF REPETITIVE UNSEGMENTED DEMONSTRATION DATA

In Proceedings of the 4th International Conference on Agents and Artificial Intelligence - Volume 2: SSIR, 673-678, 2012 , Vilamoura, Algarve, Portugal

Author: Frederick L. Crabbe

Affiliation: US Naval Academy, United States

Keyword(s): Robots, Plan Learning, Learning from Demonstration, Minimal Programs.

Abstract: This paper presents an algorithm that enables a robot to learn from demonstration by inferring a nearly minimal plan instead of the more common policy. The algorithm uses only the demon- strated actions to build the plan, without relying on observation of the world states during the demonstration. By making assumptions about the format of the data, it can generate this plan in O(n5).

CC BY-NC-ND 4.0

Guest: Register as new SciTePress user now for free.

SciTePress user: please login.

My Papers

You are not signed in, therefore limits apply to your IP address 18.227.0.249

In the current month:

Recent papers: 100 available of 100 total

2⁺ years older papers: 200 available of 200 total

Paper citation in several formats:

L. Crabbe, F. (2012). EFFICIENTLY FINDING (NEARLY) MINIMAL FST OF REPETITIVE UNSEGMENTED DEMONSTRATION DATA. In Proceedings of the 4th International Conference on Agents and Artificial Intelligence (ICAART 2012) - Volume 2: SSIR; ISBN 978-989-8425-95-9; ISSN 2184-433X, SciTePress, pages 673-678. DOI: 10.5220/0003881906730678

@conference{ssir12,
author={Frederick {L. Crabbe}.},
title={EFFICIENTLY FINDING (NEARLY) MINIMAL FST OF REPETITIVE UNSEGMENTED DEMONSTRATION DATA},
booktitle={Proceedings of the 4th International Conference on Agents and Artificial Intelligence (ICAART 2012) - Volume 2: SSIR},
year={2012},
pages={673-678},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003881906730678},
isbn={978-989-8425-95-9},
issn={2184-433X},
}

TY - CONF

JO - Proceedings of the 4th International Conference on Agents and Artificial Intelligence (ICAART 2012) - Volume 2: SSIR
TI - EFFICIENTLY FINDING (NEARLY) MINIMAL FST OF REPETITIVE UNSEGMENTED DEMONSTRATION DATA
SN - 978-989-8425-95-9
IS - 2184-433X
AU - L. Crabbe, F.
PY - 2012
SP - 673
EP - 678
DO - 10.5220/0003881906730678
PB - SciTePress