arXiv 2104.034442021-04-08math.OC

Applications of Controlled Sweeping Processes to Nonlinear Crowd Motion Models with Obstacles

Tan Cao, Boris Mordukhovich, Dao Nguyen, Trang Nguyen

英文摘要：

This paper mainly focuses on solving the dynamic optimization of the planar controlled crowd motion models with obstacles which is an application of a class of optimal control problems governed by a general perturbed nonconvex sweeping process. This can be considered as a significant extension of the previous work regarding the controlled crowd motion models, where the obstacles have not been considered. The necessary optimality conditions for the problem under consideration are established and illustrated by a nontrivial example of practical importance.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Applications of Optimal Control of a Nonconvex Sweeping Process to Optimization of the Planar Crowd Motion Model

This paper concerns optimal control of a nonconvex perturbed sweeping process and its applications to optimization of the planar crowd motion model of traffic equilibria. The obtained theoretical results allow us to investigate a dynamic optimization problem for the microscopic planar crown motion model with finitely many participants and completely solve it analytically in the case of two participants.

2018-02-22math.OC

Crowd motion paradigm modeled by a bilevel sweeping control problem

This article concerns an optimal crowd motion control problem in which the crowd features a structure given by its organization into N groups (participants) each one spatially confined in a set. The overall optimal control problem consists in driving the ensemble of sets as close as possible to a given point (the 'exit') while the population in each set minimizes its control effort subject to its sweeping dynamics with a controlled state dependent velocity drift. In order to capture the conflict between the goal of the overall population and those of the various groups, the problem is cast as …

2021-04-19math.OC

Optimality conditions for a controlled sweeping process with applications to the crowd motion model

The paper concerns the study and applications of a new class of optimal control problems governed by a perturbed sweeping process of the hysteresis type with control functions acting in both play-and-stop operator and additive perturbations. Such control problems can be reduced to optimization of discontinuous and unbounded differential inclusions with pointwise state constraints, which are immensely challenging in control theory and prevent employing conventional variation techniques to derive necessary optimality conditions. We develop the method of discrete approximations married with appro…

2015-11-28math.OC

Optimal Control of Sweeping Processes in Robotics and Traffic Flow Models

The paper is mostly devoted to applications of a novel optimal control theory for perturbed sweeping/Moreau processes to two practical dynamical models. The first model addresses mobile robot dynamics with obstacles, and the second one concerns control and optimization of traffic flows. Describing these models as controlled sweeping processes with pointwise/hard control and state constraints and applying new necessary optimality conditions for such systems allow us to develop efficient procedures to solve naturally formulated optimal control problems for the models under consideration and comp…

2018-11-05math.OC

Optimal control of a nonconvex perturbed sweeping process

The paper concerns optimal control of discontinuous differential inclusions of the normal cone type governed by a generalized version of the Moreau sweeping process with control functions acting in both nonconvex moving sets and additive perturbations. This is a new class of optimal control problems in comparison with previously considered counterparts where the controlled sweeping sets are described by convex polyhedra. Besides a theoretical interest, a major motivation for our study of such challenging optimal control problems with intrinsic state constraints comes from the application to th…

2017-11-07math.OC

A Maximum Principle for a Time-Optimal Bilevel Sweeping Control Problem

In this article, we investigate a time-optimal state-constrained bilevel optimal control problem whose lower-level dynamics feature a sweeping control process involving a {\it truncated normal cone}. By bilevel, it is meant that the optimization of the upper level problem is carried out over the solution set of the lower level problem.This problem instance arises in structured crowd motion control problems in a confined space. We establish the corresponding necessary optimality conditions in the Gamkrelidze's form. The analysis relies on the {\it smooth approximation} of the lower level sweepi…

2022-01-06math.OC

更多相关论文收起更多论文

Projection process with definable right-hand side

We study the relation between sweeping processes with the cone of limiting normals and projection processes. We prove the existence of solution of a perturbed sweeping process with the cone of limiting normals and of nonstationary projection process, provided the sets involved are definable (and are moving in a definable way) in some o-minimal structure. An application to a crowd motion model is presented.

2017-11-09math.OC

若干运动模型的最优控制

Optimal Control of Several Motion Models

本文研究平面环境下含多智能体与障碍物的受控人群运动模型，将其建模为带扰动的非凸扫掠过程最优控制问题，推导最优性必要条件并提出算法，辅以仿真示例与开源实现。

2025-01-17math.OC

Handling obstacles in pedestrian simulations: models and optimization

In this paper we are concerned with the simulation of crowds in built environments, where obstacles play a role in the dynamics and in the interactions among pedestrians. First of all, we review the state-of-the-art of the techniques for handling obstacles in numerical simulations. Then, we introduce a new modelling technique which guarantees both impermeability and opacity of the obstacles, and does not require ad hoc runtime interventions to avoid collisions. Most important, we solve a complex optimization problem by means of the Particle Swarm Optimization method in order to exploit the so-…

2016-06-16math-phmath.MPmath.OC