Real-time motion planning and decision-making for a group of differential drive robots under connectivity constraints using robust MPC and mixed-integer programming

This work is concerned with the problem of planning trajectories and assigning tasks for a Multi-Agent System (MAS) comprised of differential drive robots. We propose a multirate hierarchical control structure that employs a planner based on robust Model Predictive Control (MPC) with mixed-integer programming (MIP) encoding. The planner computes trajectories and assigns tasks for each element of the group in real-time, while also guaranteeing the communication network of the MAS to be robustly connected at all times. Additionally, we provide a data-based methodology to estimate the disturbances sets required by the robust MPC formulation. The results are demonstrated with experiments in two obstacle-filled scenariosComment: Submitted to Advanced Robotics special issue on Online Motion Planning and Model Predictive Contro

A Mixed-Integer Approach for Motion Planning of Nonholonomic Robots under Visible Light Communication Constraints

This work addresses the problem of motion planning for a group of nonholonomic robots under Visible Light Communication (VLC) connectivity requirements. In particular, we consider an inspection task performed by a Robot Chain Control System (RCCS), where a leader must visit relevant regions of an environment while the remaining robots operate as relays, maintaining the connectivity between the leader and a base station. We leverage Mixed-Integer Linear Programming (MILP) to design a trajectory planner that can coordinate the RCCS, minimizing time and control effort while also handling the issues of directed Line-Of-Sight (LOS), connectivity over directed networks, and the nonlinearity of the robots' dynamics. The efficacy of the proposal is demonstrated with realistic simulations in the Gazebo environment using the Turtlebot3 robot platform.Comment: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessibl

Constrained pre-equalization accounting for multi-path fading emulated using large RC networks: applications to wireless and photonics communications

Multi-path propagation is modelled assuming a multi-layer RC network with randomly allocated resistors and capacitors to represent the transmission medium. Due to frequency-selective attenuation, the waveforms associated with each propagation path incur path-dependent distortion. A pre-equalization procedure that takes into account the capabilities of the transmission source as well as the transmission properties of the medium is developed. The problem is cast within a Mixed Integer Linear Programming optimization framework that uses the developed nominal RC network model, with the excitation waveform customized to optimize signal fidelity from the transmitter to the receiver. The objective is to match a Gaussian pulse input accounting for frequency regions where there would be pronounced fading. Simulations are carried out with different network realizations in order to evaluate the sensitivity of the solution with respect to changes in the transmission medium mimicking the multi-path propagation. The proposed approach is of relevance where equalization techniques are difficult to implement. Applications are discussed within the context of emergent communication modalities across the EM spectrum such as light percolation as well as emergent indoor communications assuming various modulation protocols or UWB schemes as well as within the context of space division multiplexing

Computational load reduction of the agent guidance problem using Mixed Integer Programming.

This paper employs a solution to the agent-guidance problem in an environment with obstacles, whose avoidance techniques have been extensively used in the last years. There is still a gap between the solution times required to obtain a trajectory and those demanded by real world applications. These usually face a tradeoff between the limited on-board processing performance and the high volume of computing operations demanded by those real-time applications. In this paper we propose a deferred decision-based technique that produces clusters used for obstacle avoidance as the agent moves in the environment, like a driver that, at night, enlightens the road ahead as her/his car moves along a highway. By considering the spatial and temporal relevance of each obstacle throughout the planning process and pruning areas that belong to the constrained domain, one may relieve the inherent computational burden of avoidance. This strategy reduces the number of operations required and increases it on demand, since a computationally heavier problem is tackled only if the simpler ones are not feasible. It consists in an improvement based solely on problem modeling, which, by example, may offer processing times in the same order of magnitude than the lower-bound given by the relaxed form of the problem

Forecast of the occupancy of standard and intensive care unit beds by COVID-19 inpatients

This paper proposes a methodology to forecast the number of hospital beds required by COVID-19 inpatients in mild and in critical conditions. To that end, a compartmental model is extended to include the number of critical inpatients, which require hospitalization in intensive care units (ICUs). The model parameters are tailored by using a data-driven approach and a computational methodology for numerical optimization. A multi-objective cost function is adopted, representing the match between the model output and the observed data for four variables, namely the total number of cases, demises, hospitalizations and ICU beds. Results for different regions of the Brazilian state of Sao Paulo are presented. The results show that the model represents well the training data and is able to predict the required health system resources.Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)2020/14357-