Abstract
One approach to qualitative reasoning about dynamical systems is to extract qualitative information by searching or making queries on databases containing many trajectories. The efficiency of such queries depends crucially upon finding an appropriate data structure for trajectories of dynamical systems. Suppose that a large number of parameterized trajectories gamma of a dynamical system evolving in R/sup N/ are stored in a database. Let eta contained in/implied by R/sup N/ denote a parameterized path in Euclidean space. A data structure is defined to represent trajectories of dynamical systems, and a sketch is given of an algorithm which answers queries of the following form: Query: return the trajectory gamma from the database which minimizes the norm on the space of paths // eta - gamma //. >
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
