MINIMUM COST PATH SEARCH IN AN UNCERTAIN-CONFIGURATION SPACE

Eric Pierre; Romain Pepy

Research.Publish.Connect.

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

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

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

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

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

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

Name:
Country:
Subject:

Advanced Search Affiliations Search

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

Proceedings

Proceedings Search

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

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

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

MINIMUM COST PATH SEARCH IN AN UNCERTAIN-CONFIGURATION SPACE

Topics: Mobile Robots and Autonomous Systems

In Proceedings of the Fourth International Conference on Informatics in Control, Automation and Robotics - Volume 4: ICINCO, 103-109, 2007 , Angers, France

Authors: Eric Pierre and Romain Pepy

Affiliation: Institut d’E´ lectronique Fondamentale, Université Paris XI, France

Keyword(s): Path planning, uncertainty, A* algorithm.

Related Ontology Subjects/Areas/Topics: Informatics in Control, Automation and Robotics ; Mobile Robots and Autonomous Systems ; Robotics and Automation

Abstract: The object of this paper is to propose a minimum cost path search algorithm in an uncertain-configuration space and to give its proofs of optimality and completeness. In order to achieve this goal, we focus on one of the simpler and efficient path search algorithm in the configuration space : the A* algorithm. We then add uncertainties and deal with them as if they were simple dof (degree of freedom). Next, we introduce towers of uncertainties in order to improve the efficiency of the search. Finally we prove the optimality and completeness of the resulting algorithm.

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 3.135.205.146

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:

Pierre, E. and Pepy, R. (2007). MINIMUM COST PATH SEARCH IN AN UNCERTAIN-CONFIGURATION SPACE. In Proceedings of the Fourth International Conference on Informatics in Control, Automation and Robotics - Volume 4: ICINCO; ISBN 978-972-8865-83-2; ISSN 2184-2809, SciTePress, pages 103-109. DOI: 10.5220/0001645301030109

@conference{icinco07,
author={Eric Pierre. and Romain Pepy.},
title={MINIMUM COST PATH SEARCH IN AN UNCERTAIN-CONFIGURATION SPACE},
booktitle={Proceedings of the Fourth International Conference on Informatics in Control, Automation and Robotics - Volume 4: ICINCO},
year={2007},
pages={103-109},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001645301030109},
isbn={978-972-8865-83-2},
issn={2184-2809},
}

TY - CONF

JO - Proceedings of the Fourth International Conference on Informatics in Control, Automation and Robotics - Volume 4: ICINCO
TI - MINIMUM COST PATH SEARCH IN AN UNCERTAIN-CONFIGURATION SPACE
SN - 978-972-8865-83-2
IS - 2184-2809
AU - Pierre, E.
AU - Pepy, R.
PY - 2007
SP - 103
EP - 109
DO - 10.5220/0001645301030109
PB - SciTePress