Search Results

Documents authored by Picard, Gauthier

Document
DOI: 10.4230/LIPIcs.CP.2026.3
Approximating Time-Dependent Transition Times in Constraint Programming for an Earth Observation Mission

Authors: Romain Barrault, Cédric Pralet, Gauthier Picard, and Eric Sawyer

Published in: LIPIcs, Volume 379, 32nd International Conference on Principles and Practice of Constraint Programming (CP 2026)

Abstract
A standard problem in the field of Earth observation is the scheduling of the observations of an agile satellite constellation. Given a set of end‑user requests over Points of Interest (POIs), the problem consists in selecting observations among the candidate ones, attributing each of them to a satellite, and defining the sequence of observations planned for each satellite under operational constraints. These constraints stem from the visibility windows of the POIs and from the time‑dependent maneuvers required to reorient the satellites between successive POI observations (duration of the maneuvers function depending on their start times). This paper presents how Constraint Programming (CP) can be applied to solve this combinatorial observation dispatching and scheduling problem, the objective being to maximize a sum of collected individual observation rewards. Our main focus is the search for efficient strategies to approximate time-dependent no-overlap constraints given CP solvers that only manage sequence-dependent no-overlap constraints. In particular, we introduce constant-step and variable-step time-discretization methods, together with several approximation parameters. To get actually feasible solutions, the CP model is coupled with a greedy repair strategy that takes time-dependency into account, and a Large Neighborhood Search (LNS) that post-optimizes the solutions. This CP-Repair-LNS pipeline delivers high‑quality solutions compared to a baseline LNS.
Cite as

Romain Barrault, Cédric Pralet, Gauthier Picard, and Eric Sawyer. Approximating Time-Dependent Transition Times in Constraint Programming for an Earth Observation Mission. In 32nd International Conference on Principles and Practice of Constraint Programming (CP 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 379, pp. 3:1-3:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)

Copy BibTex To Clipboard

@InProceedings{barrault_et_al:LIPIcs.CP.2026.3,
  author =	{Barrault, Romain and Pralet, C\'{e}dric and Picard, Gauthier and Sawyer, Eric},
  title =	{{Approximating Time-Dependent Transition Times in Constraint Programming for an Earth Observation Mission}},
  booktitle =	{32nd International Conference on Principles and Practice of Constraint Programming (CP 2026)},
  pages =	{3:1--3:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-432-1},
  ISSN =	{1868-8969},
  year =	{2026},
  volume =	{379},
  editor =	{Beldiceanu, Nicolas},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2026.3},
  URN =		{urn:nbn:de:0030-drops-266368},
  doi =		{10.4230/LIPIcs.CP.2026.3},
  annote =	{Keywords: Earth observation satellites, Constraint Programming, Large Neighborhood Search, Scheduling}
}
Document
DOI: 10.4230/LIPIcs.CP.2026.40
Configuration of Heterogeneous Agent Fleets for Cognitively Demanding Missions

Authors: Lucas Ligny, Stéphanie Roussel, Gauthier Picard, and Élise Vareilles

Published in: LIPIcs, Volume 379, 32nd International Conference on Principles and Practice of Constraint Programming (CP 2026)

Abstract
This paper addresses the early stage design of a search-and-rescue mission by focusing on the configuration of the agent fleet, i.e., the selection and customization of each autonomous unit. To guide this configuration, two key evaluation criteria are introduced: (i) the performance - effectiveness of the fleet for executing the mission - and (ii) the operability - human workload required to supervise the fleet. We formally define the joint optimization problem that simultaneously selects a fleet layout and assesses these criteria, and we present a unified Constraint Programming model to solve it. The model incorporates three interchangeable cognitive workload sub-models of increasing granularity, allowing designers to test different assumptions about operator workload while balancing the two criteria. Experiments on realistic instances inspired by the RoboCup Rescue Simulation League show that the approach efficiently identifies several fleet configurations, offering a human-centered approach for early mission design.
Cite as

Lucas Ligny, Stéphanie Roussel, Gauthier Picard, and Élise Vareilles. Configuration of Heterogeneous Agent Fleets for Cognitively Demanding Missions. In 32nd International Conference on Principles and Practice of Constraint Programming (CP 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 379, pp. 40:1-40:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)

Copy BibTex To Clipboard

@InProceedings{ligny_et_al:LIPIcs.CP.2026.40,
  author =	{Ligny, Lucas and Roussel, St\'{e}phanie and Picard, Gauthier and Vareilles, \'{E}lise},
  title =	{{Configuration of Heterogeneous Agent Fleets for Cognitively Demanding Missions}},
  booktitle =	{32nd International Conference on Principles and Practice of Constraint Programming (CP 2026)},
  pages =	{40:1--40:22},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-432-1},
  ISSN =	{1868-8969},
  year =	{2026},
  volume =	{379},
  editor =	{Beldiceanu, Nicolas},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2026.40},
  URN =		{urn:nbn:de:0030-drops-266724},
  doi =		{10.4230/LIPIcs.CP.2026.40},
  annote =	{Keywords: Configuration, Heterogeneous Agent Fleet, Cognitive Load, Constraint Programming}
}
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact