Catálogo de publicaciones - libros

Compartir en
redes sociales


Handbook of Geometric Computing: Applications in Pattern Recognition, Computer Vision, Neuralcomputing, and Robotics

Eduardo Bayro Corrochano

Resumen/Descripción – provisto por la editorial

No disponible.

Palabras clave – provistas por la editorial

No disponibles.

Disponibilidad
Institución detectada Año de publicación Navegá Descargá Solicitá
No detectada 2005 SpringerLink

Información

Tipo de recurso:

libros

ISBN impreso

978-3-540-20595-1

ISBN electrónico

978-3-540-28247-1

Editor responsable

Springer Nature

País de edición

Reino Unido

Fecha de publicación

Información sobre derechos de publicación

© Springer-Verlag Berlin Heidelberg 2005

Tabla de contenidos

Geometric Methods for Multirobot Optimal Motion Planning

Calin Belta; Vijay Kumar

The signed real measure of regular languages, introduced in Chapter 1, has been the driving force for quantitative analysis and synthesis of discrete-event supervisory (DES) control systems dealing with finite state automata (equivalently, regular languages). However, this approach relies on memoryless state-based tools for supervisory control synthesis and may become inadequate if the transitions in the plant dynamics cannot be captured by finitely many states. From this perspective, the measure of regular languages needs to be extended to that of non-regular languages, such as Petri nets or other higher level languages in the Chomsky hierarchy [9]. The development of measures for non-regular languages is a topic of future research that has not apparently been reported in open literature. This chapter introduces two research topics in the field of language-measure-based supervisory control. One topic is complex measure of non-regular languages, dealing with . The proposed complex measure reduces to the signed real measure [16] [12] [15], as presented in Chapter 1, if the is degenerated to a regular grammar. The other topic is modification of the (regular) language measure for supervisory control under partial observation. This chapter shows how to generalize the analysis to situations where some of the events may not be observable at the supervisory level.

Part VIII - Geometry and Robotics | Pp. 679-706

The Computation of Reachable Surfaces for a Specified Set of Spatial Displacements

J. Michael McCarthy; Hai-Jun Su

The signed real measure of regular languages, introduced in Chapter 1, has been the driving force for quantitative analysis and synthesis of discrete-event supervisory (DES) control systems dealing with finite state automata (equivalently, regular languages). However, this approach relies on memoryless state-based tools for supervisory control synthesis and may become inadequate if the transitions in the plant dynamics cannot be captured by finitely many states. From this perspective, the measure of regular languages needs to be extended to that of non-regular languages, such as Petri nets or other higher level languages in the Chomsky hierarchy [9]. The development of measures for non-regular languages is a topic of future research that has not apparently been reported in open literature. This chapter introduces two research topics in the field of language-measure-based supervisory control. One topic is complex measure of non-regular languages, dealing with . The proposed complex measure reduces to the signed real measure [16] [12] [15], as presented in Chapter 1, if the is degenerated to a regular grammar. The other topic is modification of the (regular) language measure for supervisory control under partial observation. This chapter shows how to generalize the analysis to situations where some of the events may not be observable at the supervisory level.

Part IX - Reaching and Motion Planning | Pp. 709-735

Planning Collision-Free Paths Using Probabilistic Roadmaps

Seth Hutchinson; Peter Leven

The signed real measure of regular languages, introduced in Chapter 1, has been the driving force for quantitative analysis and synthesis of discrete-event supervisory (DES) control systems dealing with finite state automata (equivalently, regular languages). However, this approach relies on memoryless state-based tools for supervisory control synthesis and may become inadequate if the transitions in the plant dynamics cannot be captured by finitely many states. From this perspective, the measure of regular languages needs to be extended to that of non-regular languages, such as Petri nets or other higher level languages in the Chomsky hierarchy [9]. The development of measures for non-regular languages is a topic of future research that has not apparently been reported in open literature. This chapter introduces two research topics in the field of language-measure-based supervisory control. One topic is complex measure of non-regular languages, dealing with . The proposed complex measure reduces to the signed real measure [16] [12] [15], as presented in Chapter 1, if the is degenerated to a regular grammar. The other topic is modification of the (regular) language measure for supervisory control under partial observation. This chapter shows how to generalize the analysis to situations where some of the events may not be observable at the supervisory level.

Part IX - Reaching and Motion Planning | Pp. 737-767