Arrow Research search

Author name cluster

Patrick Taillibert

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

11 papers
2 author rows

Possible papers

11

AAMAS Conference 2016 Conference Paper

A Multi-Agent System for Resource Privacy: Deployment of Ambient Applications in Smart Environments (Extended Abstract)

  • Ferdinand Piette
  • Costin Caval
  • Amal El Fallah Seghrouchni
  • Patrick Taillibert
  • Cédric Dinont

In this paper, we present Multi-Agent Systems (MAS) as a well-adapted paradigm for designing software for the configuration, deployment and monitoring of distributed applications in the domain of Ambient Intelligence (AmI). We show how privacy is enhanced by hiding information using the agent architecture and organisation. We introduce privacy policies that can allow or prevent the sharing of resource information. This results in privacy by design.

ICAART Conference 2009 Conference Paper

A New Performative for Handling Lack of Answers of Autonomous Agents

  • Katia Potiron
  • Patrick Taillibert
  • Amal El Fallah Seghrouchni

An agent can send a message and never receive a response, this is what we name the ”empty mailbox problem” this paper is concerned with. The causes of the problem can lie in low level layer as, for instance, in communication links, but also in the behavior of the autonomous entity the agent is interacting with, which can choose not to respond. The task is not easy, for the agents developer, to find what is to do in such cases. The proposed solution consists in a performative and the associated meta-protocol. This results into a generic method to handle the empty mailbox problem in the case of temporary faults. Some prospects are given to handle permanent faults.

ICRA Conference 2009 Conference Paper

Time-minimal path planning in dynamic current fields

  • Michaël Soulignac
  • Patrick Taillibert
  • Michel Rueher

Numerous approaches have been proposed for path planning in dynamic current fields, for a fixed departure time. However, in many applications, the departure time is not necessarily known in advance, but can vary in a time window. In this context, the choice of a good departure time is a critical issue. That is why we introduce in this paper a new approach, called symbolic wavefront expansion, determining both the path and the departure time minimizing the travel time of the vehicle. The key idea of this approach is to propagate and compose functions instead of numerical values, with appropriate operators.

ICRA Conference 2008 Conference Paper

Adapting the wavefront expansion in presence of strong currents

  • Michaël Soulignac
  • Patrick Taillibert
  • Michel Rueher

The wavefront expansion is commonly used for path planning tasks and appreciated for its efficiency. However, the existing extensions able to handle currents are subject to incorrectness and incompleteness issues when these currents become strong. That is, they may return physically infeasible paths or no path at all, even if a feasible path exists. This behavior endangers the robot, especially in a dynamic replanning context. That is why we propose a new extension called sliding wavefront expansion. This algorithm, combining an appropriate cost function and continuous optimization techniques, guarantees the existence of a path with an arbitrary precision.

AAMAS Conference 2008 Conference Paper

AERIAL: Hypothetical Trajectory Planning for Multi-UAVs Coordination and Control

  • Paul-Edouard Marson
  • Michael Soulignac
  • Patrick Taillibert

This paper presents a distributed application named AERIAL which allows coordination and control of multiple Unmanned Aerial Vehicles (UAVs) engaged in temporally constrained missions. This application combines multiagent paradigm and trajectory planning techniques and relies on a coordination model taking both deliberation and planning durations into account.

IROS Conference 2007 Conference Paper

Multiple path planning using wavefront collision

  • Michaël Soulignac
  • Patrick Taillibert

The concept of wavefront expansion was introduced in order to build a collision-free path between two points among obstacles, minimizing a criterion. In this paper, we propose a new concept, called wavefront collision, in order to do the same for all possible paths between n waypoints. It consists in expanding simultaneously one wavefront by waypoint, until they collide. Using this concept, all paths can be computed thanks to one multiple wavefront expansion instead of n - 1, hence dividing the computational effort by about 3. 5.

ECAI Conference 2006 Conference Paper

Prevention of Harmful Behaviors Within Cognitive and Autonomous Agents

  • Caroline Chopinaud
  • Amal El Fallah Seghrouchni
  • Patrick Taillibert

Being able to ensure that a multiagent system will not generate undesirable behaviors is essential within the context of critical applications (embedded systems or real-time systems). The emergence of behaviors from the agents interaction can generate situations incompatible with the expected system execution. The standard methods to validate a multiagent system do not prevent the occurrence of undesirable behaviors during its execution in real condition. We propose a complementary approach of dynamic self-monitoring and self-regulation allowing the agents to control their own behavior. This paper goes on to present the automatic generation of self-controlled agents. We use the observer approach to verify that the agents behavior respects a set of laws throughout the system execution.

IJCAI Conference 1999 Conference Paper

Maximization of the Average Quality of Anytime Contract Algorithms over a Time Interval

  • Arnaud Delhay Max Dauchet
  • Patrick Taillibert
  • Philippe Vanheeghe

Previous studies considered quality optimization of anytime algorithms by taking into account the quality of the final result. The problem we are interested in is the maximization of the average quality of a contract algorithm over a time interval. We first informally illustrate and motivate this problem with few concrete situations. Then we prove that the problem is NPhard, but quadratic if the time interval is large enough. Eventually we give empirical results.

v2026.09.13