The Experts below are selected from a list of 74547 Experts worldwide ranked by ideXlab platform

Henk Wymeersch - One of the best experts on this subject based on the ideXlab platform.

  • An approximate solution to the optimal Coordination Problem for autonomous vehicles at intersections
    Proceedings of the American Control Conference, 2015
    Co-Authors: Robert Hult, Gabriel R Campos, Paolo Falcone, Henk Wymeersch
    Abstract:

    In this paper, we address the Problem of optimal and safe Coordination of autonomous vehicles through a traffic intersection. We state the Problem as a finite time, constrained optimal control Problem, a combinatorial optimization prob- lem that is difficult to solve in real-time. A low complexity computational scheme is proposed, based on a hierarchical decomposition of the original optimal control formulation, where a central Coordination Problem is solved together with a number of local optimal control Problems for each vehicle. We show how the proposed decomposition allows a reduction of the complexity of the central Problem, provided that approxi- mated parametric solutions of the local Problems are available beforehand. We derive conditions for the construction of the parametric approximations and demonstrate the method with a numerical example.

  • ACC - An approximate solution to the optimal Coordination Problem for autonomous vehicles at intersections
    2015 American Control Conference (ACC), 2015
    Co-Authors: Robert Hult, Gabriel R Campos, Paolo Falcone, Henk Wymeersch
    Abstract:

    In this paper, we address the Problem of optimal and safe Coordination of autonomous vehicles through a traffic intersection. We state the Problem as a finite time, constrained optimal control Problem, a combinatorial optimization Problem that is difficult to solve in real-time. A low complexity computational scheme is proposed, based on a hierarchical decomposition of the original optimal control formulation, where a central Coordination Problem is solved together with a number of local optimal control Problems for each vehicle. We show how the proposed decomposition allows a reduction of the complexity of the central Problem, provided that approximated parametric solutions of the local Problems are available beforehand. We derive conditions for the construction of the parametric approximations and demonstrate the method with a numerical example.

Robert Hult - One of the best experts on this subject based on the ideXlab platform.

  • An approximate solution to the optimal Coordination Problem for autonomous vehicles at intersections
    Proceedings of the American Control Conference, 2015
    Co-Authors: Robert Hult, Gabriel R Campos, Paolo Falcone, Henk Wymeersch
    Abstract:

    In this paper, we address the Problem of optimal and safe Coordination of autonomous vehicles through a traffic intersection. We state the Problem as a finite time, constrained optimal control Problem, a combinatorial optimization prob- lem that is difficult to solve in real-time. A low complexity computational scheme is proposed, based on a hierarchical decomposition of the original optimal control formulation, where a central Coordination Problem is solved together with a number of local optimal control Problems for each vehicle. We show how the proposed decomposition allows a reduction of the complexity of the central Problem, provided that approxi- mated parametric solutions of the local Problems are available beforehand. We derive conditions for the construction of the parametric approximations and demonstrate the method with a numerical example.

  • ACC - An approximate solution to the optimal Coordination Problem for autonomous vehicles at intersections
    2015 American Control Conference (ACC), 2015
    Co-Authors: Robert Hult, Gabriel R Campos, Paolo Falcone, Henk Wymeersch
    Abstract:

    In this paper, we address the Problem of optimal and safe Coordination of autonomous vehicles through a traffic intersection. We state the Problem as a finite time, constrained optimal control Problem, a combinatorial optimization Problem that is difficult to solve in real-time. A low complexity computational scheme is proposed, based on a hierarchical decomposition of the original optimal control formulation, where a central Coordination Problem is solved together with a number of local optimal control Problems for each vehicle. We show how the proposed decomposition allows a reduction of the complexity of the central Problem, provided that approximated parametric solutions of the local Problems are available beforehand. We derive conditions for the construction of the parametric approximations and demonstrate the method with a numerical example.

A. Vuckovic - One of the best experts on this subject based on the ideXlab platform.

  • A flexible approach to short-term hydro-thermal Coordination. I. Problem formulation and general solution procedure
    IEEE Transactions on Power Systems, 1996
    Co-Authors: S. Ruzic, N. Rajakovic, A. Vuckovic
    Abstract:

    This paper presents a new flexible approach based on Lagrangian relaxation for solving the hydro-thermal Coordination Problem. Part I and Part II of this work make a complete theoretical and practical tool in order to solve this large scale, nonlinear, nonconvex and dynamic Problem. The final result is an efficient and proven programming package within operation planning needs. Part I deals with the general Problem formulation, with the application of the decomposition technique and with the primal Problem solving. Methodological and modeling improvements are presented concerning costs of the excessive hydro production and advancements in the primal Problem solving. The numerical simulations show flexibility of the proposed procedure which can be used to solve the short-term hydro-thermal Coordination Problem in completely different power systems.

Brahim Chaibdraa - One of the best experts on this subject based on the ideXlab platform.

  • partial local friendq multiagent learning application to team automobile Coordination Problem
    Lecture Notes in Computer Science, 2006
    Co-Authors: Julien Laumonier, Brahim Chaibdraa
    Abstract:

    Real world multiagent Coordination Problems are important issues for reinforcement learning techniques. In general, these Problems are partially observable and this characteristic makes the solution computation intractable. Most of the existing approaches calculate exact or approximate solutions using the world model for only one agent. To handle a special case of partial observability, this article presents an approach to approximate the policy measuring a degree of observability for pure cooperative vehicle Coordination Problem. We compare empirically the performance of the learned policy for totally observable Problems and performances of policies for different degrees of observability. If each degree of observability is associated with communication costs, multiagent system designers are able to choose a compromise between the performance of the policy and the cost to obtain the associated degree of observability of the Problem. Finally, we show how the available space, surrounding an agent, influence the required degree of observability for near-optimal solution.

Paolo Falcone - One of the best experts on this subject based on the ideXlab platform.

  • An approximate solution to the optimal Coordination Problem for autonomous vehicles at intersections
    Proceedings of the American Control Conference, 2015
    Co-Authors: Robert Hult, Gabriel R Campos, Paolo Falcone, Henk Wymeersch
    Abstract:

    In this paper, we address the Problem of optimal and safe Coordination of autonomous vehicles through a traffic intersection. We state the Problem as a finite time, constrained optimal control Problem, a combinatorial optimization prob- lem that is difficult to solve in real-time. A low complexity computational scheme is proposed, based on a hierarchical decomposition of the original optimal control formulation, where a central Coordination Problem is solved together with a number of local optimal control Problems for each vehicle. We show how the proposed decomposition allows a reduction of the complexity of the central Problem, provided that approxi- mated parametric solutions of the local Problems are available beforehand. We derive conditions for the construction of the parametric approximations and demonstrate the method with a numerical example.

  • ACC - An approximate solution to the optimal Coordination Problem for autonomous vehicles at intersections
    2015 American Control Conference (ACC), 2015
    Co-Authors: Robert Hult, Gabriel R Campos, Paolo Falcone, Henk Wymeersch
    Abstract:

    In this paper, we address the Problem of optimal and safe Coordination of autonomous vehicles through a traffic intersection. We state the Problem as a finite time, constrained optimal control Problem, a combinatorial optimization Problem that is difficult to solve in real-time. A low complexity computational scheme is proposed, based on a hierarchical decomposition of the original optimal control formulation, where a central Coordination Problem is solved together with a number of local optimal control Problems for each vehicle. We show how the proposed decomposition allows a reduction of the complexity of the central Problem, provided that approximated parametric solutions of the local Problems are available beforehand. We derive conditions for the construction of the parametric approximations and demonstrate the method with a numerical example.