Self-Triggered Optimal Control Based on Path Search Algorithm
This paper proposes a path search formulation and its solution method to a finite optimal control problem on self-triggered control systems. Previous methods to the problem have high computational complexity. This paper focuses on the formulation and its data structure for reduction of calculation t...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2019-05-01
|
| Series: | SICE Journal of Control, Measurement, and System Integration |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.9746/jcmsi.12.85 |
| Summary: | This paper proposes a path search formulation and its solution method to a finite optimal control problem on self-triggered control systems. Previous methods to the problem have high computational complexity. This paper focuses on the formulation and its data structure for reduction of calculation time and reformulates the optimal control problem to a path search problem. We also consider a data structure of a graph for the path search problem. The key point is the sharing of vertices. The sharing leads to the reduction of calculation time. We compare the calculation time of the path search algorithm and the mixed-logical dynamical method. |
|---|---|
| ISSN: | 1884-9970 |