Logical Architecture for Robot Path Planning

Autores
Katz, Román; Delrieux, Claudio
Año de publicación
2003
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
In this work we present a robot path planning architecture based on Lee's routing algorithm. This algorithm was originally conceived to obtain minimal conductor nets among terminals on VLSI circuits. In our system it provides a simple and robust mechanism to compute near to shortest free paths in two-dimensional configuration environments. We incorporate this algorithm in a planning system, and the resulting architecture can be used to generate trajectories in order to guide a mobile agent from an initial point to a final (static or moving) position of the working space, avoiding not only static but also moving obstacles. The guidance engine is implemented as a rule-based version of Lee's algorithm, embedded in a multi-paradigm software system that performs logical inferences in a Prolog component, whose results are provided to an imperative and numerical processing compiled component. This allows a neat factorization of the functionality of the system: high level representation of the navigation algorithm is implemented through its logical formulation, and easy and natural means to acquire the layout of the environment with computer vision and image processing techniques is implemented via numerical programming. The same imperative approach is also natural to provide 2D or 3D visualization and simulation features to aid to understand the ongoing process. Thus, our architecture features both the speed and versatility of a visual language application, and the abstraction level and modularity of a logical description.
Sociedad Argentina de Informática e Investigación Operativa
Materia
Ciencias Informáticas
Robot Path Planning
Lee’s Algorithm
Mobile Agents
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-sa/4.0/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/185212

id SEDICI_a6a5298036204fc06d275a7838552d52
oai_identifier_str oai:sedici.unlp.edu.ar:10915/185212
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling Logical Architecture for Robot Path PlanningKatz, RománDelrieux, ClaudioCiencias InformáticasRobot Path PlanningLee’s AlgorithmMobile AgentsIn this work we present a robot path planning architecture based on Lee's routing algorithm. This algorithm was originally conceived to obtain minimal conductor nets among terminals on VLSI circuits. In our system it provides a simple and robust mechanism to compute near to shortest free paths in two-dimensional configuration environments. We incorporate this algorithm in a planning system, and the resulting architecture can be used to generate trajectories in order to guide a mobile agent from an initial point to a final (static or moving) position of the working space, avoiding not only static but also moving obstacles. The guidance engine is implemented as a rule-based version of Lee's algorithm, embedded in a multi-paradigm software system that performs logical inferences in a Prolog component, whose results are provided to an imperative and numerical processing compiled component. This allows a neat factorization of the functionality of the system: high level representation of the navigation algorithm is implemented through its logical formulation, and easy and natural means to acquire the layout of the environment with computer vision and image processing techniques is implemented via numerical programming. The same imperative approach is also natural to provide 2D or 3D visualization and simulation features to aid to understand the ongoing process. Thus, our architecture features both the speed and versatility of a visual language application, and the abstraction level and modularity of a logical description.Sociedad Argentina de Informática e Investigación Operativa2003-09info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdfhttp://sedici.unlp.edu.ar/handle/10915/185212enginfo:eu-repo/semantics/altIdentifier/issn/1666-1079info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/4.0/Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-10-15T11:42:27Zoai:sedici.unlp.edu.ar:10915/185212Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-10-15 11:42:28.007SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv Logical Architecture for Robot Path Planning
title Logical Architecture for Robot Path Planning
spellingShingle Logical Architecture for Robot Path Planning
Katz, Román
Ciencias Informáticas
Robot Path Planning
Lee’s Algorithm
Mobile Agents
title_short Logical Architecture for Robot Path Planning
title_full Logical Architecture for Robot Path Planning
title_fullStr Logical Architecture for Robot Path Planning
title_full_unstemmed Logical Architecture for Robot Path Planning
title_sort Logical Architecture for Robot Path Planning
dc.creator.none.fl_str_mv Katz, Román
Delrieux, Claudio
author Katz, Román
author_facet Katz, Román
Delrieux, Claudio
author_role author
author2 Delrieux, Claudio
author2_role author
dc.subject.none.fl_str_mv Ciencias Informáticas
Robot Path Planning
Lee’s Algorithm
Mobile Agents
topic Ciencias Informáticas
Robot Path Planning
Lee’s Algorithm
Mobile Agents
dc.description.none.fl_txt_mv In this work we present a robot path planning architecture based on Lee's routing algorithm. This algorithm was originally conceived to obtain minimal conductor nets among terminals on VLSI circuits. In our system it provides a simple and robust mechanism to compute near to shortest free paths in two-dimensional configuration environments. We incorporate this algorithm in a planning system, and the resulting architecture can be used to generate trajectories in order to guide a mobile agent from an initial point to a final (static or moving) position of the working space, avoiding not only static but also moving obstacles. The guidance engine is implemented as a rule-based version of Lee's algorithm, embedded in a multi-paradigm software system that performs logical inferences in a Prolog component, whose results are provided to an imperative and numerical processing compiled component. This allows a neat factorization of the functionality of the system: high level representation of the navigation algorithm is implemented through its logical formulation, and easy and natural means to acquire the layout of the environment with computer vision and image processing techniques is implemented via numerical programming. The same imperative approach is also natural to provide 2D or 3D visualization and simulation features to aid to understand the ongoing process. Thus, our architecture features both the speed and versatility of a visual language application, and the abstraction level and modularity of a logical description.
Sociedad Argentina de Informática e Investigación Operativa
description In this work we present a robot path planning architecture based on Lee's routing algorithm. This algorithm was originally conceived to obtain minimal conductor nets among terminals on VLSI circuits. In our system it provides a simple and robust mechanism to compute near to shortest free paths in two-dimensional configuration environments. We incorporate this algorithm in a planning system, and the resulting architecture can be used to generate trajectories in order to guide a mobile agent from an initial point to a final (static or moving) position of the working space, avoiding not only static but also moving obstacles. The guidance engine is implemented as a rule-based version of Lee's algorithm, embedded in a multi-paradigm software system that performs logical inferences in a Prolog component, whose results are provided to an imperative and numerical processing compiled component. This allows a neat factorization of the functionality of the system: high level representation of the navigation algorithm is implemented through its logical formulation, and easy and natural means to acquire the layout of the environment with computer vision and image processing techniques is implemented via numerical programming. The same imperative approach is also natural to provide 2D or 3D visualization and simulation features to aid to understand the ongoing process. Thus, our architecture features both the speed and versatility of a visual language application, and the abstraction level and modularity of a logical description.
publishDate 2003
dc.date.none.fl_str_mv 2003-09
dc.type.none.fl_str_mv info:eu-repo/semantics/conferenceObject
info:eu-repo/semantics/publishedVersion
Objeto de conferencia
http://purl.org/coar/resource_type/c_5794
info:ar-repo/semantics/documentoDeConferencia
format conferenceObject
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/185212
url http://sedici.unlp.edu.ar/handle/10915/185212
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/issn/1666-1079
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-sa/4.0/
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-sa/4.0/
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1846064431337832448
score 13.22299