Kota Kondo, Andrea Tagliabue, Xiaoyi Cai, Claudius Tewari, Olivia Garcia, Marcos Espitia-Alvarez, Jonathan P. How
{"title":"CGD:用于无人飞行器轨迹规划的约束引导扩散策略","authors":"Kota Kondo, Andrea Tagliabue, Xiaoyi Cai, Claudius Tewari, Olivia Garcia, Marcos Espitia-Alvarez, Jonathan P. How","doi":"arxiv-2405.01758","DOIUrl":null,"url":null,"abstract":"Traditional optimization-based planners, while effective, suffer from high\ncomputational costs, resulting in slow trajectory generation. A successful\nstrategy to reduce computation time involves using Imitation Learning (IL) to\ndevelop fast neural network (NN) policies from those planners, which are\ntreated as expert demonstrators. Although the resulting NN policies are\neffective at quickly generating trajectories similar to those from the expert,\n(1) their output does not explicitly account for dynamic feasibility, and (2)\nthe policies do not accommodate changes in the constraints different from those\nused during training. To overcome these limitations, we propose Constraint-Guided Diffusion (CGD),\na novel IL-based approach to trajectory planning. CGD leverages a hybrid\nlearning/online optimization scheme that combines diffusion policies with a\nsurrogate efficient optimization problem, enabling the generation of\ncollision-free, dynamically feasible trajectories. The key ideas of CGD include\ndividing the original challenging optimization problem solved by the expert\ninto two more manageable sub-problems: (a) efficiently finding collision-free\npaths, and (b) determining a dynamically-feasible time-parametrization for\nthose paths to obtain a trajectory. Compared to conventional neural network\narchitectures, we demonstrate through numerical evaluations significant\nimprovements in performance and dynamic feasibility under scenarios with new\nconstraints never encountered during training.","PeriodicalId":501062,"journal":{"name":"arXiv - CS - Systems and Control","volume":"35 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"CGD: Constraint-Guided Diffusion Policies for UAV Trajectory Planning\",\"authors\":\"Kota Kondo, Andrea Tagliabue, Xiaoyi Cai, Claudius Tewari, Olivia Garcia, Marcos Espitia-Alvarez, Jonathan P. How\",\"doi\":\"arxiv-2405.01758\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Traditional optimization-based planners, while effective, suffer from high\\ncomputational costs, resulting in slow trajectory generation. A successful\\nstrategy to reduce computation time involves using Imitation Learning (IL) to\\ndevelop fast neural network (NN) policies from those planners, which are\\ntreated as expert demonstrators. Although the resulting NN policies are\\neffective at quickly generating trajectories similar to those from the expert,\\n(1) their output does not explicitly account for dynamic feasibility, and (2)\\nthe policies do not accommodate changes in the constraints different from those\\nused during training. To overcome these limitations, we propose Constraint-Guided Diffusion (CGD),\\na novel IL-based approach to trajectory planning. CGD leverages a hybrid\\nlearning/online optimization scheme that combines diffusion policies with a\\nsurrogate efficient optimization problem, enabling the generation of\\ncollision-free, dynamically feasible trajectories. The key ideas of CGD include\\ndividing the original challenging optimization problem solved by the expert\\ninto two more manageable sub-problems: (a) efficiently finding collision-free\\npaths, and (b) determining a dynamically-feasible time-parametrization for\\nthose paths to obtain a trajectory. Compared to conventional neural network\\narchitectures, we demonstrate through numerical evaluations significant\\nimprovements in performance and dynamic feasibility under scenarios with new\\nconstraints never encountered during training.\",\"PeriodicalId\":501062,\"journal\":{\"name\":\"arXiv - CS - Systems and Control\",\"volume\":\"35 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-05-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Systems and Control\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2405.01758\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Systems and Control","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2405.01758","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
传统的基于优化的规划器虽然有效,但计算成本高,导致轨迹生成速度慢。一种减少计算时间的成功策略是使用模仿学习(IL)从这些规划器中开发出快速神经网络(NN)策略,并将其视为专家示范。虽然由此产生的 NN 策略能有效快速生成与专家示范轨迹相似的轨迹,但(1) 它们的输出并没有明确考虑动态可行性,(2) 策略无法适应与训练过程中使用的约束条件不同的变化。为了克服这些局限性,我们提出了约束引导扩散(Constraint-Guided Diffusion,简称 CGD),这是一种基于 IL 的新型轨迹规划方法。CGD 利用混合学习/在线优化方案,将扩散策略与代用高效优化问题相结合,从而生成无碰撞、动态可行的轨迹。CGD 的主要思想包括将专家解决的原始高难度优化问题划分为两个更易于管理的子问题:(a)高效地找到无碰撞路径,以及(b)确定这些路径的动态可行时间参数化,从而获得轨迹。与传统的神经网络架构相比,我们通过数值评估证明,在训练过程中从未遇到新约束条件的情况下,神经网络的性能和动态可行性都有显著提高。
CGD: Constraint-Guided Diffusion Policies for UAV Trajectory Planning
Traditional optimization-based planners, while effective, suffer from high
computational costs, resulting in slow trajectory generation. A successful
strategy to reduce computation time involves using Imitation Learning (IL) to
develop fast neural network (NN) policies from those planners, which are
treated as expert demonstrators. Although the resulting NN policies are
effective at quickly generating trajectories similar to those from the expert,
(1) their output does not explicitly account for dynamic feasibility, and (2)
the policies do not accommodate changes in the constraints different from those
used during training. To overcome these limitations, we propose Constraint-Guided Diffusion (CGD),
a novel IL-based approach to trajectory planning. CGD leverages a hybrid
learning/online optimization scheme that combines diffusion policies with a
surrogate efficient optimization problem, enabling the generation of
collision-free, dynamically feasible trajectories. The key ideas of CGD include
dividing the original challenging optimization problem solved by the expert
into two more manageable sub-problems: (a) efficiently finding collision-free
paths, and (b) determining a dynamically-feasible time-parametrization for
those paths to obtain a trajectory. Compared to conventional neural network
architectures, we demonstrate through numerical evaluations significant
improvements in performance and dynamic feasibility under scenarios with new
constraints never encountered during training.