Please use this identifier to cite or link to this item: http://hdl.handle.net/2080/5850
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSwaraj, Tara-
dc.contributor.authorNath, Krishanu-
dc.contributor.authorBera, Manas Kumar-
dc.contributor.authorMishra, Rajiv Kumar-
dc.contributor.authorChakraborty, Sudipta-
dc.date.accessioned2026-07-03T12:47:28Z-
dc.date.available2026-07-03T12:47:28Z-
dc.date.issued2026-06-
dc.identifier.citation15th Asian Control Conference (ASCC-2026) Bali, Indonesia, 17-21 June 2026en_US
dc.identifier.urihttp://hdl.handle.net/2080/5850-
dc.descriptionCopyright belongs to proceeding publisheren_US
dc.description.abstractThis paper presents a fixed-time sliding mode control (FXT-SMC) scheme for multi-agent systems (MASs) having double-integrator dynamics to address the leader-follower consensus (LFC) problems. The proposed consensus strategy employs a variable exponent which depends on the state to ensure fixed-time convergence under the SMC framework. A barrier-function-based adaptive algorithm is introduced to avoid overestimation of gain. This mechanism dynamically regulates the discontinuous control gain and prevents unnecessary gain overestimation, thereby reducing chattering in the control input. The input-to-state stability (ISS) of the fixed-time protocol for leader–follower consensus dynamics is rigorously proven through Lyapunov-based analysis. Finally, simulation studies are carried out to demonstrate and validate the performance and feasibility of the introduced control design approach.en_US
dc.subjectFixed-time consensus with variable exponenten_US
dc.subjectsliding mode controlen_US
dc.subjectleader-follower consensusen_US
dc.subjectadaptive gainen_US
dc.titleBarrier Function-Driven Robust Fixed-Time Leader–Follower Consensus with Variable Exponent Controlen_US
dc.typeArticleen_US
Appears in Collections:Conference Papers

Files in This Item:
File Description SizeFormat 
2026_ASSC_RKMishra_Barrier.pdf481.86 kBAdobe PDFView/Open    Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.