Maximilian Kloock
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Maximilian Kloock has a total of 26 co-authors. Here are the top co-authors by number of shared publications:
- Bassam Alrifaee
University of the Bundeswehr Munich
6 shared publications - Patrick Scheffe
KU Leuven
4 shared publications Bassam Alrifaee
3 shared publicationsStefan Kowalewski
2 shared publications- Amanda Prorok
University of Cambridge
1 shared publication - Armin Mokhtarian
RWTH Aachen University, Aachen, Germany
1 shared publication
Latest Publications
- 30 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics & Automation Magazine
- Vol. 32 (3) , 146-163
A Survey on Small-Scale Testbeds for Connected and Automated Vehicles and Robot Swarms: A Guide for Creating a New Testbed [Survey]
Connected and automated vehicles (CAVs) and robot swarms (RSs) hold transformative potential for enhancing safety, efficiency, and sustainability in the transportation and manufacturing sectors. Extensive testing and validation of these technologies are crucial for their deployment in the real world. While simulations are essential for initial testing, they often have limitations in capturing the complex dynamics of real-world interactions. This limitation underscores the importance of small-scale testbeds. These testbeds provide a realistic, cost-effective, and controlled environment for testing and validating algorithms, acting as an essential intermediary between simulation and full-scale experiments. This work serves to facilitate researchers’ efforts in identifying existing small-scale testbeds suitable for their experiments and provide insights for those who want to build their own. In addition, it delivers a comprehensive survey of the current landscape of these testbeds. We derive 62 characteristics of testbeds based on the well-known sense–plan–act paradigm and offer an online table comparing 23 small-scale testbeds based on these characteristics. The online table is hosted on our designated public webpage, https://bassamlab.github.io/testbeds-survey, and we invite testbed creators and developers to contribute to it. We closely examine nine testbeds in this article, demonstrating how the derived characteristics can be used to present testbeds. Furthermore, we discuss three ongoing challenges concerning small-scale testbeds that we identified, i.e., small-scale to full-scale transition, sustainability, and power and resource management.
- 30 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics & Automation Magazine
- Vol. 32 (3) , 146-163
A Survey on Small-Scale Testbeds for Connected and Automated Vehicles and Robot Swarms: A Guide for Creating a New Testbed [Survey]
Connected and automated vehicles (CAVs) and robot swarms (RSs) hold transformative potential for enhancing safety, efficiency, and sustainability in the transportation and manufacturing sectors. Extensive testing and validation of these technologies are crucial for their deployment in the real world. While simulations are essential for initial testing, they often have limitations in capturing the complex dynamics of real-world interactions. This limitation underscores the importance of small-scale testbeds. These testbeds provide a realistic, cost-effective, and controlled environment for testing and validating algorithms, acting as an essential intermediary between simulation and full-scale experiments. This work serves to facilitate researchers’ efforts in identifying existing small-scale testbeds suitable for their experiments and provide insights for those who want to build their own. In addition, it delivers a comprehensive survey of the current landscape of these testbeds. We derive 62 characteristics of testbeds based on the well-known sense–plan–act paradigm and offer an online table comparing 23 small-scale testbeds based on these characteristics. The online table is hosted on our designated public webpage, https://bassamlab.github.io/testbeds-survey, and we invite testbed creators and developers to contribute to it. We closely examine nine testbeds in this article, demonstrating how the derived characteristics can be used to present testbeds. Furthermore, we discuss three ongoing challenges concerning small-scale testbeds that we identified, i.e., small-scale to full-scale transition, sustainability, and power and resource management.
- Open Access
- 3 August 2024
- Published by Springer Nature
- p. 347-412
AutoKnigge—Modeling, Evaluation and Verification of Cooperative Interacting Automobiles
The development of cooperative driving functions to optimize traffic systems shows high potential to improve individual autonomous driving systems with respect to topics like traffic flow, vehicle safety and user comfort. The core concept of the presented solutions is the Local Traffic System (LTS). Following the messages defined in European Telecommunications Standards Institute (ETSI) Intelligent Transport Systems (ITS) G5 for Vehicle-to-everything (V2X) cooperation we introduce concepts and implementations to intelligently group vehicles based on the exchanged V2X data with respect to the individual vehicle capability for cooperation. Based on the determined grouping, we present algorithms for cooperative trajectory planning. We develop a verification method for the cooperatively planned trajectories within a LTS. The verification guarantees collision avoidance and deadlock-freeness in real-time. Finally we introduce a model language based on MontiArc to enable a systematic representation and description of the presented concepts for grouping, cooperation and interaction.
- 3 August 2024
- Published by Springer Nature
- p. 347-412
Open AccessAutoKnigge—Modeling, Evaluation and Verification of Cooperative Interacting Automobiles
The development of cooperative driving functions to optimize traffic systems shows high potential to improve individual autonomous driving systems with respect to topics like traffic flow, vehicle safety and user comfort. The core concept of the presented solutions is the Local Traffic System (LTS). Following the messages defined in European Telecommunications Standards Institute (ETSI) Intelligent Transport Systems (ITS) G5 for Vehicle-to-everything (V2X) cooperation we introduce concepts and implementations to intelligently group vehicles based on the exchanged V2X data with respect to the individual vehicle capability for cooperation. Based on the determined grouping, we present algorithms for cooperative trajectory planning. We develop a verification method for the cooperatively planned trajectories within a LTS. The verification guarantees collision avoidance and deadlock-freeness in real-time. Finally we introduce a model language based on MontiArc to enable a systematic representation and description of the presented concepts for grouping, cooperation and interaction.
- Open Access
- 1 April 2023
- Published by Walter de Gruyter GmbH in at - Automatisierungstechnik
- Vol. 71 (4) , 317-325
Testing distributed trajectory planning in the cyber-physical mobility lab
This article presents the testing of distributed trajectory planning algorithms using our rapid prototyping platform, the Cyber-Physical Mobility Lab (CPM Lab). We propose two algorithms for distributed trajectory planning which plan trajectories at intersections, highway on- and off-ramps, and lane changes for networked and autonomous vehicles. The algorithms avoid collisions between vehicles using a synchronization-based and a prioritized Distributed Model Predictive Control (DMPC) strategy. We test two algorithms in the CPM Lab which is able to handle parallel, sequential, and hybrid computations. The CPM Lab achieves reproducible experiments under non-deterministic computation times and stochastic communication times. Our evaluation shows that different algorithms for distributed trajectory planning can be efficiently tested in different in-the-loop tests.
- 1 April 2023
- Published by Walter de Gruyter GmbH in at - Automatisierungstechnik
- Vol. 71 (4) , 317-325
Open AccessTesting distributed trajectory planning in the cyber-physical mobility lab
This article presents the testing of distributed trajectory planning algorithms using our rapid prototyping platform, the Cyber-Physical Mobility Lab (CPM Lab). We propose two algorithms for distributed trajectory planning which plan trajectories at intersections, highway on- and off-ramps, and lane changes for networked and autonomous vehicles. The algorithms avoid collisions between vehicles using a synchronization-based and a prioritized Distributed Model Predictive Control (DMPC) strategy. We test two algorithms in the CPM Lab which is able to handle parallel, sequential, and hybrid computations. The CPM Lab achieves reproducible experiments under non-deterministic computation times and stochastic communication times. Our evaluation shows that different algorithms for distributed trajectory planning can be efficiently tested in different in-the-loop tests.
- Open Access
- 1 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of Intelligent Transportation Systems
- Vol. 4, 175-186
An Architecture for Experiments in Connected and Automated Vehicles
Rapid prototyping of Connected and Automated Vehicles (CAV) is challenging because of the physical distribution of vehicles. Furthermore, experiments with CAV may be subject to external influences which prevent reproducibility. This article presents an architecture for the experimental testing of CAVs, focusing on decision-making. Our architecture for experiments of CAV is strictly modular and hierarchical, and therefore it supports an easy and rapid exchange of every single controller as well as of optimization libraries. Additionally, the architecture synchronizes the whole network of sensors, computation devices, and actuators. Thus, it achieves deterministic and reproducible results, even for time-variant network topologies. Using this architecture, we can include active and passive vehicles and vehicles with heterogeneous dynamics in the experiments. The architecture also allows for handling communication uncertainties, e.g., data packet drop and time delay. The resulting architecture supports performing different in-the-loop tests and experiments. We demonstrate the architecture in the Cyber-Physical Mobility Lab (CPM Lab) using 20 vehicles on a 1:18 scale. The architecture can be applied to other domains.
- 1 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of Intelligent Transportation Systems
- Vol. 4, 175-186
Open AccessAn Architecture for Experiments in Connected and Automated Vehicles
Rapid prototyping of Connected and Automated Vehicles (CAV) is challenging because of the physical distribution of vehicles. Furthermore, experiments with CAV may be subject to external influences which prevent reproducibility. This article presents an architecture for the experimental testing of CAVs, focusing on decision-making. Our architecture for experiments of CAV is strictly modular and hierarchical, and therefore it supports an easy and rapid exchange of every single controller as well as of optimization libraries. Additionally, the architecture synchronizes the whole network of sensors, computation devices, and actuators. Thus, it achieves deterministic and reproducible results, even for time-variant network topologies. Using this architecture, we can include active and passive vehicles and vehicles with heterogeneous dynamics in the experiments. The architecture also allows for handling communication uncertainties, e.g., data packet drop and time delay. The resulting architecture supports performing different in-the-loop tests and experiments. We demonstrate the architecture in the Cyber-Physical Mobility Lab (CPM Lab) using 20 vehicles on a 1:18 scale. The architecture can be applied to other domains.
- Open Access
- 24 January 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
Coordinated Cooperative Distributed Decision-Making using Synchronization of Local Plans
Centralized decision-making for a Networked Control System (NCS) suffers from a high computational burden on the planning agent. Distributed agents, which compute cooperative decision-making, increase computational performance. In cooperative decision-making, agents locally plan for a subset of all agents. Due to only local system knowledge of the agents, these local plans are inconsistent with the local plans of other agents. This inconsistency leads to the infeasibility of plans. This article introduces an algorithm for synchronizing local plans for cooperative distributed decision-making. The algorithm enables parallel decision-making and achieves feasible decisions. The algorithm consists of two iterative steps: local planning and global synchronization. In the local planning step, the agents parallelly compute local decisions, referred to as plans. Subsequently, consistency of the local plans across agents is achieved using global synchronization. The globally synchronized plans act as reference decisions for the local planning step in the next iteration. In each iteration, the local planning guarantees locally feasible plans, while the synchronization guarantees globally consistent plans in that iteration. The parallel algorithm converges to globally feasible decisions if the coupling topology is feasible. We introduce requirements for the coupling topology to achieve convergence to globally feasible decisions and present the algorithm using a model predictive control example. Our evaluations with car-like robots show that globally feasible decisions are achieved.
- 24 January 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
Open AccessCoordinated Cooperative Distributed Decision-Making using Synchronization of Local Plans
Centralized decision-making for a Networked Control System (NCS) suffers from a high computational burden on the planning agent. Distributed agents, which compute cooperative decision-making, increase computational performance. In cooperative decision-making, agents locally plan for a subset of all agents. Due to only local system knowledge of the agents, these local plans are inconsistent with the local plans of other agents. This inconsistency leads to the infeasibility of plans. This article introduces an algorithm for synchronizing local plans for cooperative distributed decision-making. The algorithm enables parallel decision-making and achieves feasible decisions. The algorithm consists of two iterative steps: local planning and global synchronization. In the local planning step, the agents parallelly compute local decisions, referred to as plans. Subsequently, consistency of the local plans across agents is achieved using global synchronization. The globally synchronized plans act as reference decisions for the local planning step in the next iteration. In each iteration, the local planning guarantees locally feasible plans, while the synchronization guarantees globally consistent plans in that iteration. The parallel algorithm converges to globally feasible decisions if the coupling topology is feasible. We introduce requirements for the coupling topology to achieve convergence to globally feasible decisions and present the algorithm using a model predictive control example. Our evaluations with car-like robots show that globally feasible decisions are achieved.
- 4 January 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Vehicles
- Vol. 8 (2) , 1292-1306
Coordinated Cooperative Distributed Decision-Making Using Synchronization of Local Plans
Centralized decision-making for a Networked Control System (NCS) suffers from a high computational burden on the planning agent. Distributed agents, which compute cooperative decision-making, increase computational performance. In cooperative decision-making, agents locally plan for a subset of all agents. Due to only local system knowledge of the agents, these local plans are inconsistent with the local plans of other agents. This inconsistency leads to the infeasibility of plans. This article introduces an algorithm for synchronizing local plans for cooperative distributed decision-making. The algorithm enables parallel decision-making and achieves feasible decisions. The algorithm consists of two iterative steps: local planning and global synchronization. In the local planning step, the agents parallelly compute local decisions, referred to as plans. Subsequently, consistency of the local plans across agents is achieved using global synchronization. The globally synchronized plans act as reference decisions for the local planning step in the next iteration. In each iteration, the local planning guarantees locally feasible plans, while the synchronization guarantees globally consistent plans in that iteration. The parallel algorithm converges to globally feasible decisions if the coupling topology is feasible. We introduce requirements for the coupling topology to achieve convergence to globally feasible decisions and present the algorithm using a model predictive control example. Our evaluations with car-like robots show that globally feasible decisions are achieved.
- 4 January 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Vehicles
- Vol. 8 (2) , 1292-1306
Coordinated Cooperative Distributed Decision-Making Using Synchronization of Local Plans
Centralized decision-making for a Networked Control System (NCS) suffers from a high computational burden on the planning agent. Distributed agents, which compute cooperative decision-making, increase computational performance. In cooperative decision-making, agents locally plan for a subset of all agents. Due to only local system knowledge of the agents, these local plans are inconsistent with the local plans of other agents. This inconsistency leads to the infeasibility of plans. This article introduces an algorithm for synchronizing local plans for cooperative distributed decision-making. The algorithm enables parallel decision-making and achieves feasible decisions. The algorithm consists of two iterative steps: local planning and global synchronization. In the local planning step, the agents parallelly compute local decisions, referred to as plans. Subsequently, consistency of the local plans across agents is achieved using global synchronization. The globally synchronized plans act as reference decisions for the local planning step in the next iteration. In each iteration, the local planning guarantees locally feasible plans, while the synchronization guarantees globally consistent plans in that iteration. The parallel algorithm converges to globally feasible decisions if the coupling topology is feasible. We introduce requirements for the coupling topology to achieve convergence to globally feasible decisions and present the algorithm using a model predictive control example. Our evaluations with car-like robots show that globally feasible decisions are achieved.
- Open Access
- 31 May 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
Generation of Coupling Topologies for Multi-Agent Systems using Non-Cooperative Games
This paper presents a method for generating coupling topologies for multi-agent systems. Our method is based on a non-cooperative game in which each agent chooses couplings to activate or deactivate using a utility function. The utility function measures the importance of agents to one another and enables conflict avoidance in distributed decisionmaking. Depending on the application's needs, our method is able to generate unidirectional or bidirectional couplings. In our evaluation, we used car-like robots in a simulation environment. It shows that the generated coupling topologies are applicable to the domain of networked and autonomous vehicles.
- 31 May 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
Open AccessGeneration of Coupling Topologies for Multi-Agent Systems using Non-Cooperative Games
This paper presents a method for generating coupling topologies for multi-agent systems. Our method is based on a non-cooperative game in which each agent chooses couplings to activate or deactivate using a utility function. The utility function measures the importance of agents to one another and enables conflict avoidance in distributed decisionmaking. Depending on the application's needs, our method is able to generate unidirectional or bidirectional couplings. In our evaluation, we used car-like robots in a simulation environment. It shows that the generated coupling topologies are applicable to the domain of networked and autonomous vehicles.
- 19 April 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Vehicles
- Vol. 8 (1) , 661-672
Sequential Convex Programming Methods for Real-Time Optimal Trajectory Planning in Autonomous Vehicle Racing
Optimization problems for trajectory planning in autonomous vehicle racing are characterized by their nonlinearity and nonconvexity. Instead of solving these optimization problems, usually a convex approximation is solved instead to achieve a high update rate. We present a real-time-capable model predictive control (MPC) based on a nonlinear single-track vehicle model and Pacejka's magic tire formula for autonomous vehicle racing. After formulating the general nonconvex trajectory optimization problem, we form a convex approximation using sequential convex programming (SCP). The state of the art convexifies track constraints using sequential linearization (SL), which is a method of relaxing the constraints. Solutions to the relaxed optimization problem are not guaranteed to be feasible in the nonconvex optimization problem. We propose sequential convex restriction (SCR) as a method to convexify track constraints. SCR guarantees that resulting solutions are feasible in the nonconvex optimization problem. We show recursive feasibility of solutions to the restricted optimization problem. The MPC is evaluated on a scaled version of the Hockenheimring racing track in simulation. The results show that an MPC using SCR yields faster lap times than an MPC using SL, while still being real-time capable.
- 19 April 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Vehicles
- Vol. 8 (1) , 661-672
Sequential Convex Programming Methods for Real-Time Optimal Trajectory Planning in Autonomous Vehicle Racing
Optimization problems for trajectory planning in autonomous vehicle racing are characterized by their nonlinearity and nonconvexity. Instead of solving these optimization problems, usually a convex approximation is solved instead to achieve a high update rate. We present a real-time-capable model predictive control (MPC) based on a nonlinear single-track vehicle model and Pacejka's magic tire formula for autonomous vehicle racing. After formulating the general nonconvex trajectory optimization problem, we form a convex approximation using sequential convex programming (SCP). The state of the art convexifies track constraints using sequential linearization (SL), which is a method of relaxing the constraints. Solutions to the relaxed optimization problem are not guaranteed to be feasible in the nonconvex optimization problem. We propose sequential convex restriction (SCR) as a method to convexify track constraints. SCR guarantees that resulting solutions are feasible in the nonconvex optimization problem. We show recursive feasibility of solutions to the restricted optimization problem. The MPC is evaluated on a scaled version of the Hockenheimring racing track in simulation. The results show that an MPC using SCR yields faster lap times than an MPC using SL, while still being real-time capable.
- Open Access
Vision-Based Real-Time Indoor Positioning System for Multiple Vehicles
We propose a novel external indoor positioning system that computes the position and orientation of multiple model-scale vehicles. For this purpose, we use a camera mounted at a height of 3.3m and LEDs attached to each vehicle. We reach an accuracy of about 1.1 cm for the position and around 0.6 {\deg} for the orientation in the mean. Our system is real-time capable with a soft deadline of 20 ms. Moreover, it is robust against changing lighting conditions and reflections.
Open AccessVision-Based Real-Time Indoor Positioning System for Multiple Vehicles
We propose a novel external indoor positioning system that computes the position and orientation of multiple model-scale vehicles. For this purpose, we use a camera mounted at a height of 3.3m and LEDs attached to each vehicle. We reach an accuracy of about 1.1 cm for the position and around 0.6 {\deg} for the orientation in the mean. Our system is real-time capable with a soft deadline of 20 ms. Moreover, it is robust against changing lighting conditions and reflections.