Numerical Solution for a Controlled Nonconvex Sweeping Process

A numerical method and the theory leading to its success are developed in this letter to solve nonstandard optimal control problems involving sweeping processes, in which the sweeping set C is non-convex and coincides with the zero-sublevel set of a smooth function having a Lipschitz gradient, and t...

وصف كامل

محفوظ في:
التفاصيل البيبلوغرافية
المؤلف الرئيسي: Nour, Chadi (author)
مؤلفون آخرون: Zeidan, Vera (author)
التنسيق: article
منشور في: 2021
الوصول للمادة أونلاين:http://hdl.handle.net/10725/13125
https://doi.org/10.1109/LCSYS.2021.3089977
http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php
https://ieeexplore.ieee.org/abstract/document/9458952
الوسوم: إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
_version_ 1864513490430984192
author Nour, Chadi
author2 Zeidan, Vera
author2_role author
author_facet Nour, Chadi
Zeidan, Vera
author_role author
dc.creator.none.fl_str_mv Nour, Chadi
Zeidan, Vera
dc.date.none.fl_str_mv 2021-11-23T14:23:30Z
2021-11-23T14:23:30Z
2021
2021-11-23
dc.identifier.none.fl_str_mv 2475-1456
http://hdl.handle.net/10725/13125
https://doi.org/10.1109/LCSYS.2021.3089977
Nour, C., & Zeidan, V. (2021). Numerical solution for a controlled nonconvex sweeping process. IEEE Control Systems Letters, 6, 1190-1195.
http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php
https://ieeexplore.ieee.org/abstract/document/9458952
dc.language.none.fl_str_mv en
dc.relation.none.fl_str_mv IEEE Control Systems Letters
dc.rights.*.fl_str_mv info:eu-repo/semantics/openAccess
dc.title.none.fl_str_mv Numerical Solution for a Controlled Nonconvex Sweeping Process
dc.type.none.fl_str_mv Article
info:eu-repo/semantics/publishedVersion
info:eu-repo/semantics/article
description A numerical method and the theory leading to its success are developed in this letter to solve nonstandard optimal control problems involving sweeping processes, in which the sweeping set C is non-convex and coincides with the zero-sublevel set of a smooth function having a Lipschitz gradient, and the fixed initial state is allowed to be any point of C. This numerical method was introduced by Pinho et al. (2020) for a special form of our problem in which the function whose zero-sublevel set defines C is restricted to be twice differentiable and convex, and the initial state is confined in the interior of their convex set C. The remarkable feature of this method is manifested in approximating the sweeping process by a sequence of standard control systems invoking an innovative exponential penalty term in lieu of the normal cone, whose presence in the sweeping process renders most standard methods inapplicable. For a general setting, we prove that the optimal solution of the approximating standard optimal control problem converges uniformly to an optimal solution of the original problem (see Remark 3). This numerical method is shown to be efficient through an example in which C is not convex and the initial state is on its boundary.
eu_rights_str_mv openAccess
format article
id LAURepo_1fbd4d07d6c00cd336d2f4ad94eb3bc9
identifier_str_mv 2475-1456
Nour, C., & Zeidan, V. (2021). Numerical solution for a controlled nonconvex sweeping process. IEEE Control Systems Letters, 6, 1190-1195.
language_invalid_str_mv en
network_acronym_str LAURepo
network_name_str Lebanese American University repository
oai_identifier_str oai:laur.lau.edu.lb:10725/13125
publishDate 2021
repository.mail.fl_str_mv
repository.name.fl_str_mv
repository_id_str
spelling Numerical Solution for a Controlled Nonconvex Sweeping ProcessNour, ChadiZeidan, VeraA numerical method and the theory leading to its success are developed in this letter to solve nonstandard optimal control problems involving sweeping processes, in which the sweeping set C is non-convex and coincides with the zero-sublevel set of a smooth function having a Lipschitz gradient, and the fixed initial state is allowed to be any point of C. This numerical method was introduced by Pinho et al. (2020) for a special form of our problem in which the function whose zero-sublevel set defines C is restricted to be twice differentiable and convex, and the initial state is confined in the interior of their convex set C. The remarkable feature of this method is manifested in approximating the sweeping process by a sequence of standard control systems invoking an innovative exponential penalty term in lieu of the normal cone, whose presence in the sweeping process renders most standard methods inapplicable. For a general setting, we prove that the optimal solution of the approximating standard optimal control problem converges uniformly to an optimal solution of the original problem (see Remark 3). This numerical method is shown to be efficient through an example in which C is not convex and the initial state is on its boundary.Published2021-11-23T14:23:30Z2021-11-23T14:23:30Z20212021-11-23Articleinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/article2475-1456http://hdl.handle.net/10725/13125https://doi.org/10.1109/LCSYS.2021.3089977Nour, C., & Zeidan, V. (2021). Numerical solution for a controlled nonconvex sweeping process. IEEE Control Systems Letters, 6, 1190-1195.http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.phphttps://ieeexplore.ieee.org/abstract/document/9458952enIEEE Control Systems Lettersinfo:eu-repo/semantics/openAccessoai:laur.lau.edu.lb:10725/131252021-11-23T14:23:56Z
spellingShingle Numerical Solution for a Controlled Nonconvex Sweeping Process
Nour, Chadi
status_str publishedVersion
title Numerical Solution for a Controlled Nonconvex Sweeping Process
title_full Numerical Solution for a Controlled Nonconvex Sweeping Process
title_fullStr Numerical Solution for a Controlled Nonconvex Sweeping Process
title_full_unstemmed Numerical Solution for a Controlled Nonconvex Sweeping Process
title_short Numerical Solution for a Controlled Nonconvex Sweeping Process
title_sort Numerical Solution for a Controlled Nonconvex Sweeping Process
url http://hdl.handle.net/10725/13125
https://doi.org/10.1109/LCSYS.2021.3089977
http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php
https://ieeexplore.ieee.org/abstract/document/9458952