Abstract
The control of dynamical systems under constraints on the the controlling force can require long term trajectory preplanning to avoid entering dead ends in phase space. To handle such problems in a flexible way we suggest to formulate them as a path finding problem on a suitably discretized version of the phase space of the system. This path finding problem can then be solved with a standard relaxation method in a parallel computation by exploiting a physical analogy: the target point in phase space is considered as the source of a diffusing substance whose concentration gradient serves as a local guide to the destination point.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
William H. Press, Brian P. Flannery, Saul A. Teukolsky, William T. Vetterling: Numerical Recipes, Cambridge (1986).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ritter, H., Schulten, K. (1987). Planning a dynamic trajectory via path finding in discretized phase space. In: Becker, J.D., Eisele, I. (eds) WOPPLOT 86 Parallel Processing: Logic, Organization, and Technology. WOPPLOT 1986. Lecture Notes in Computer Science, vol 253. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18022-2_3
Download citation
DOI: https://doi.org/10.1007/3-540-18022-2_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18022-7
Online ISBN: 978-3-540-47709-9
eBook Packages: Springer Book Archive