A time-dependent symplectic network for non-convex path planning problems with linear and nonlinear dynamics
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866917743326920704 |
|---|---|
| author | Zhang, Zhen Wang, Chenye Liu, Shanqing Darbon, Jerome Karniadakis, George |
| author_facet | Zhang, Zhen Wang, Chenye Liu, Shanqing Darbon, Jerome Karniadakis, George |
| contents | We propose a novel neural network architecture (TSympOCNet) to address high--dimensional optimal control problems with linear and nonlinear dynamics. An important application of this method is to solve the path planning problem of multi-agent vehicles in real time. The new method extends our previous SympOCNet framework by introducing a time-dependent symplectic network into the architecture. In addition, we propose a more general latent representation, which greatly improves model expressivity based on the universal approximation theorem. We demonstrate the efficacy of TSympOCNet in path planning problems with obstacle and collision avoidance, including systems with Newtonian dynamics and non-convex environments, up to dimension 512. Our method shows significant promise in handling efficiently both complex dynamics and constraints. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_03785 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A time-dependent symplectic network for non-convex path planning problems with linear and nonlinear dynamics Zhang, Zhen Wang, Chenye Liu, Shanqing Darbon, Jerome Karniadakis, George Optimization and Control We propose a novel neural network architecture (TSympOCNet) to address high--dimensional optimal control problems with linear and nonlinear dynamics. An important application of this method is to solve the path planning problem of multi-agent vehicles in real time. The new method extends our previous SympOCNet framework by introducing a time-dependent symplectic network into the architecture. In addition, we propose a more general latent representation, which greatly improves model expressivity based on the universal approximation theorem. We demonstrate the efficacy of TSympOCNet in path planning problems with obstacle and collision avoidance, including systems with Newtonian dynamics and non-convex environments, up to dimension 512. Our method shows significant promise in handling efficiently both complex dynamics and constraints. |
| title | A time-dependent symplectic network for non-convex path planning problems with linear and nonlinear dynamics |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2408.03785 |