Francisco Javier Muros
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Francisco Javier Muros has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Jose Maria Maestre
Department of Systems and Automation Engineering, University of Seville, Seville, Spain
13 shared publications - Eduardo Fernandez Camacho
Universidad de Sevilla
5 shared publications - Ascensión Zafra-Cabeza
Universidad de Sevilla
2 shared publications - Carlos Ocampo-Martinez
Universitat Politecnica de Catalunya
2 shared publications - Encarnación Algaba
Matemática Aplicada II and Instituto de Matemáticas de la Universidad de Sevilla (IMUS), Escuela Superior de Ingenieros, Sevilla, Spain
2 shared publications - Pablo Velarde
Department of Engineering, Universidad Loyola Andalucia, 41704 Dos Hermanas, Spain
2 shared publications
Latest Publications
- Open Access
- 17 October 2026
- Published by Elsevier in Computer Methods and Programs in Biomedicine
- Vol. 288
Weighted scenario-based model predictive control for cancer treatment using a spatial evolutionary game framework
- 17 October 2026
- Published by Elsevier in Computer Methods and Programs in Biomedicine
- Vol. 288
Open AccessWeighted scenario-based model predictive control for cancer treatment using a spatial evolutionary game framework
- Open Access
- 1 September 2025
- Published by Universidade da Coruna in Jornadas de Automática
- No. 46
Gestión de escenarios ponderados en entornos estocásticos usando control predictivo basado en modelo
Este artículo presenta una formulación detallada del control predictivo basado en modelo con escenarios ponderados (WS-MPC, por sus siglas en inglés) orientada a sistemas lineales con incertidumbres. El enfoque propuesto combina técnicas de optimización robusta y generación de múltiples escenarios dinámicos del sistema, asignando una ponderación diferenciada al escenario de peor caso dentro del problema de control. Esta estrategia permite una mayor resiliencia ante perturbaciones estocásticas y modelado incierto, mejorando la capacidad del controlador para anticiparse a comportamientos no esperados. El WS-MPC adapta dinámicamente las acciones de control en función de la evolución de todos los escenarios considerados, manteniendo la factibilidad y estabilidad del sistema ante condiciones desfavorables. Los resultados de simulación demuestran que el enfoque propuesto incrementa la robustez operativa del sistema y proporciona una respuesta más segura y confiable frente a variaciones inesperadas. En particular, este controlador se ha implementado en un caso de estudio académico centrado en la gestión del inventario de una tienda.
- 1 September 2025
- Published by Universidade da Coruna in Jornadas de Automática
- No. 46
Open AccessGestión de escenarios ponderados en entornos estocásticos usando control predictivo basado en modelo
Este artículo presenta una formulación detallada del control predictivo basado en modelo con escenarios ponderados (WS-MPC, por sus siglas en inglés) orientada a sistemas lineales con incertidumbres. El enfoque propuesto combina técnicas de optimización robusta y generación de múltiples escenarios dinámicos del sistema, asignando una ponderación diferenciada al escenario de peor caso dentro del problema de control. Esta estrategia permite una mayor resiliencia ante perturbaciones estocásticas y modelado incierto, mejorando la capacidad del controlador para anticiparse a comportamientos no esperados. El WS-MPC adapta dinámicamente las acciones de control en función de la evolución de todos los escenarios considerados, manteniendo la factibilidad y estabilidad del sistema ante condiciones desfavorables. Los resultados de simulación demuestran que el enfoque propuesto incrementa la robustez operativa del sistema y proporciona una respuesta más segura y confiable frente a variaciones inesperadas. En particular, este controlador se ha implementado en un caso de estudio académico centrado en la gestión del inventario de una tienda.
- Open Access
- 23 November 2022
- Published by Elsevier in Robotics and Autonomous Systems
- Vol. 161
Multi-robot task allocation clustering based on game theory
- 23 November 2022
- Published by Elsevier in Robotics and Autonomous Systems
- Vol. 161
Open AccessMulti-robot task allocation clustering based on game theory
- Open Access
- 5 September 2022
- Published by Elsevier in Journal of the Franklin Institute
- Vol. 359 (17) , 9836-9859
Coalitional games for networked controllers with constraints on semivalues: A randomized design approach
- 5 September 2022
- Published by Elsevier in Journal of the Franklin Institute
- Vol. 359 (17) , 9836-9859
Open AccessCoalitional games for networked controllers with constraints on semivalues: A randomized design approach
- Open Access
- 9 August 2022
- Published by Elsevier in Electric Power Systems Research
- Vol. 213
Improving supply quality in distribution power networks: A game-theoretic planning approach
- 9 August 2022
- Published by Elsevier in Electric Power Systems Research
- Vol. 213
Open AccessImproving supply quality in distribution power networks: A game-theoretic planning approach
- 7 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 67 (12) , 6873-6880
Distributed Model Predictive Control for Tracking: A Coalitional Clustering Approach
In this article, a coalitional robust model predictive controller for tracking target sets is presented. The overall system is controlled by a set of local control agents that dynamically merge into cooperative coalitions or clusters so as to attain an efficient tradeoff between cooperation burden and global performance optimality. Within each cluster, the agents coordinate their inputs to maximize their collective performance, while considering the coupling effect with external subsystems as uncertainty. By using a tube-based approach, the overall system state is driven to the target sets while satisfying state and input constraints despite the changes in the controllers’ clustering. Likewise, feasibility and stability of the closed-loop system are guaranteed by tracking techniques. The applicability of the proposed approach is illustrated by an academic example.
- 7 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 67 (12) , 6873-6880
Distributed Model Predictive Control for Tracking: A Coalitional Clustering Approach
In this article, a coalitional robust model predictive controller for tracking target sets is presented. The overall system is controlled by a set of local control agents that dynamically merge into cooperative coalitions or clusters so as to attain an efficient tradeoff between cooperation burden and global performance optimality. Within each cluster, the agents coordinate their inputs to maximize their collective performance, while considering the coupling effect with external subsystems as uncertainty. By using a tube-based approach, the overall system state is driven to the target sets while satisfying state and input constraints despite the changes in the controllers’ clustering. Likewise, feasibility and stability of the closed-loop system are guaranteed by tracking techniques. The applicability of the proposed approach is illustrated by an academic example.
- 26 May 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 8 (4) , 1730-1742
Clustering Switching Regions for Feedback Controllers: A Convex Approach
Coalitional control groups dynamically local controllers into clusters that jointly determine their control actions to maximize control performance while minimizing the cooperation burden. This work presents linear matrix inequalities decision methods to set state-space regions where the switchings between network topologies satisfy properties of interest. In particular, convexity guarantees ellipsoidal switching sets with back-switchings avoided via a dwell time. Also, the convexity property is exploited to analyze the need for coordination at different points of the state space, leading to coordination effort zones. Moreover, by considering invariance , new ellipsoids that confine the state between topologies transitions are provided. Finally, we introduce additional conditions to attain submodularity and, hence, reduce the effort to find optimal solutions. A numerical example is given to illustrate the feasibility of the proposed approach.
- 26 May 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 8 (4) , 1730-1742
Clustering Switching Regions for Feedback Controllers: A Convex Approach
Coalitional control groups dynamically local controllers into clusters that jointly determine their control actions to maximize control performance while minimizing the cooperation burden. This work presents linear matrix inequalities decision methods to set state-space regions where the switchings between network topologies satisfy properties of interest. In particular, convexity guarantees ellipsoidal switching sets with back-switchings avoided via a dwell time. Also, the convexity property is exploited to analyze the need for coordination at different points of the state space, leading to coordination effort zones. Moreover, by considering invariance , new ellipsoids that confine the state between topologies transitions are provided. Finally, we introduce additional conditions to attain submodularity and, hence, reduce the effort to find optimal solutions. A numerical example is given to illustrate the feasibility of the proposed approach.
- Open Access
- 6 April 2021
- Published by Universitat Politecnica de Valencia in Revista Iberoamericana de Automática e Informática Industrial
- Vol. 18 (2) , 97-112
El control coalicional en el marco de la teoría de juegos cooperativos
El control coalicional es una rama incipiente del control distribuido donde los distintos agentes se agrupan de forma dinámica en coaliciones en función de los enlaces de comunicación activos/inactivos en cada instante de tiempo. Gracias a ello, se reduce la carga de comunicación sin comprometer las prestaciones del sistema. En este tutorial, se analizan las principales características de estos esquemas dentro del marco de la teoría de juegos cooperativos, estando el juego definido por la función de coste a optimizar en el esquema de control, y correspondiendo los jugadores bien a los enlaces de comunicación o bien a los propios agentes. En este contexto, se estudiarán diversas herramientas de teoría de juegos cooperativos, con objeto de clasificar jugadores, imponer restricciones en los mismos, proponer vías de cálculo más eficientes, realizar particionado de sistemas, etc., examinando las características más relevantes presentadas por cada herramienta.
- 6 April 2021
- Published by Universitat Politecnica de Valencia in Revista Iberoamericana de Automática e Informática Industrial
- Vol. 18 (2) , 97-112
Open AccessEl control coalicional en el marco de la teoría de juegos cooperativos
El control coalicional es una rama incipiente del control distribuido donde los distintos agentes se agrupan de forma dinámica en coaliciones en función de los enlaces de comunicación activos/inactivos en cada instante de tiempo. Gracias a ello, se reduce la carga de comunicación sin comprometer las prestaciones del sistema. En este tutorial, se analizan las principales características de estos esquemas dentro del marco de la teoría de juegos cooperativos, estando el juego definido por la función de coste a optimizar en el esquema de control, y correspondiendo los jugadores bien a los enlaces de comunicación o bien a los propios agentes. En este contexto, se estudiarán diversas herramientas de teoría de juegos cooperativos, con objeto de clasificar jugadores, imponer restricciones en los mismos, proponer vías de cálculo más eficientes, realizar particionado de sistemas, etc., examinando las características más relevantes presentadas por cada herramienta.
- Open Access
Modular Feedback Control of Networked Systems by Clustering: A Drinking Water Network Case Study
This article presents a method based on linear matrix inequalities (LMIs) for designing a modular feedback control law, whose synthesis guarantees the system stability, while switching to different network topologies. Such stability is achieved by means of a common Lyapunov function to all network admissible configurations. Several mechanisms to relieve the computational burden of this methodology in large-scale systems are also presented. To assess its applicability, the modular controller is tested on a real case study, namely the Barcelona drinking water network (DWN), and its performance is compared with that of other control strategies, showing the effectiveness of the proposed approach.
Open AccessModular Feedback Control of Networked Systems by Clustering: A Drinking Water Network Case Study
This article presents a method based on linear matrix inequalities (LMIs) for designing a modular feedback control law, whose synthesis guarantees the system stability, while switching to different network topologies. Such stability is achieved by means of a common Lyapunov function to all network admissible configurations. Several mechanisms to relieve the computational burden of this methodology in large-scale systems are also presented. To assess its applicability, the modular controller is tested on a real case study, namely the Barcelona drinking water network (DWN), and its performance is compared with that of other control strategies, showing the effectiveness of the proposed approach.
- 1 January 2020
- Published by Elsevier in IFAC-PapersOnLine
- Vol. 53 (2) , 4020-4025
A Modular Feedback Approach for Distributed Control
- 1 January 2020
- Published by Elsevier in IFAC-PapersOnLine
- Vol. 53 (2) , 4020-4025
A Modular Feedback Approach for Distributed Control