Certification of Bottleneck Task Assignment With Shortest Path Criteria

Related publications (30)

About
Privacy
Disclaimer

Graph Chatbot

Soft Robotics: A Route to Equality, Diversity, and Inclusivity in Robotics

Robotics is entering our daily lives. The discipline is increasingly crucial in fields such as agriculture, medicine, and rescue operations, impacting our food, health, and planet. At the same time, it is becoming evident that robotic research must embrace ...

Mary Ann Liebert, Inc2024

Succinct ordering and aggregation constraints in algebraic array theories

Viktor Kuncak, Rodrigo Raya

We discuss two extensions to a recently introduced theory of arrays, which are based on considerations coming from the model theory of power structures. First, we discuss how the ordering relation on the index set can be expressed succinctly by referring t ...

Elsevier Science Inc2024

VDMNav: Software Architecture for Aerodynamically Constrained Navigation on Small Fixed-Wing Drones

Jan Skaloud, Gabriel François Laupré

Navigation of drones is predominantly based on sensor fusion algorithms. Most of these algorithms make use of some form of Bayesian filtering with a majority employing an Extended Kalman Filter (EKF), wherein inertial measurements are fused with a Global N ...

2024

Quantifying the Unknown: Data-Driven Approaches and Applications in Energy Systems

Paul Scharnhorst

In light of the challenges posed by climate change and the goals of the Paris Agreement, electricity generation is shifting to a more renewable and decentralized pattern, while the operation of systems like buildings is increasingly electrified. This calls ...

EPFL2024

A ride time-oriented scheduling algorithm for dial-a-ride problems

Nikolaos Geroliminis, Claudia Bongiovanni, Mor Kaspi

This paper offers a new algorithm to efficiently optimize scheduling decisions for dial-a-ride problems (DARPs), including problem variants considering electric and autonomous vehicles (e-ADARPs). The scheduling heuristic, based on linear programming theor ...

Pergamon-Elsevier Science Ltd2024

Approximation Algorithms for Allocation and Network Design

Etienne Michel François Bamas

In this thesis, we give new approximation algorithms for some NP-hard problems arising in resource allocation and network design. As a resource allocation problem, we study the Santa Claus problem (also known as the MaxMin Fair Allocation problem) in which ...

EPFL2023

Results on Sparse Integer Programming and Geometric Independent Sets

Jana Tabea Cslovjecsek

An integer linear program is a problem of the form max{c^T x : Ax=b, x >= 0, x integer}, where A is in Z^(n x m), b in Z^m, and c in Z^n. Solving an integer linear program is NP-hard in general, but there are several assumptions for which it becomes fixed ...

EPFL2023

Multi-robot task allocation for safe planning against stochastic hazard dynamics

Maryam Kamgarpour, Orcun Karaca

We address multi-robot safe mission planning in uncertain dynamic environments. This problem arises in several applications including safety-critical exploration, surveillance, and emergency rescue missions. Computation of a multi-robot optimal control pol ...

IEEE2023

Information-Driven Gas Distribution Mapping for Autonomous Mobile Robots

Alcherio Martinoli, Chiara Ercolani, Faezeh Rahbar

The ability to sense airborne pollutants with mobile robots provides a valuable asset for domains such as industrial safety and environmental monitoring. Oftentimes, this involves detecting how certain gases are spread out in the environment, commonly refe ...

MDPI2023

Avian-Inspired Claws Enable Robot Perching or Walking

Dario Floreano, Won Dong Shin, William John Stewart, Mohammad Askari

Multimodal unmanned aerial vehicles (UAVs) are rarely capable of more than two modalities, i.e., flying and walking or flying and perching. However, being able to fly, perch, and walk could further improve their usefulness by expanding their operating enve ...

2023

Page 2 of 3