@booklet {11, title = {Optimal synthesis for nonholonomic vehicles with constrained side sensors}, year = {2011}, note = {

Technical Report

}, keywords = {Embedded Control, Robotics}, author = {P Salaris and L. Pallottino and A. Bicchi} } @article {BCPT03, title = {On-line Robotic Experiments for Tele-Education at the University of Pisa}, journal = {Int. Journal of Robotic Systems}, volume = {22}, number = {4}, year = {2005}, note = {

Special Issue on Internet \& Online Robots for Telemanipulation

}, pages = {217-230}, abstract = {

In this paper we describe work being done at our department to make the Robotics Laboratory accessible to student and colleagues, to execute and watch real-time experiments at any time and from anywhere. We describe few different installations, and highlight the underlying philosophy, wich is aimed at enlarging the lab in all the dimensions of space, time, and available resources, through the use of Internet technologies.

}, keywords = {Robotics}, author = {A. Bicchi and A. Caiti and L. Pallottino and G. Tonietti} } @inbook {PLPB02, title = {Optimal control of quantized input systems}, booktitle = {Hybrid Systems: Computation and Control}, series = {Lecture Notes in Computer Science}, volume = {LNCS 2289}, year = {2002}, pages = {351-363}, publisher = {Springer-Verlag}, organization = {Springer-Verlag}, address = {Heidelberg, Germany}, abstract = {

In this paper we consider the problem of optimal control (specifically, minimum-time steering) for systems with quantized inputs. In particular, we propose a new approach to the solution of the optimal control problem for an important class of nonlinear systems, i.e. chained-form systems. By exploiting results on the structure of the reachability set of these systems under quantized control, the optimal solution is determined solving an integer linear programming problem. Our algorithm represents an improvement with respect to classical approaches in terms of exactness, as it does not resort to any a priori state-space discretization. Although the computational complexity of the problem in our formulation is still formally exponential, it lends itself to application of Branch and Bound techniques, which substantially cuts down computations in many cases, as it has been experimentally observed.

}, keywords = {Embedded Control, Robotics}, author = {S. Pancanti and L. Leonardi and L. Pallottino and A. Bicchi}, editor = {C. Tomlin and M. Greenstreet} } @conference {PPB02, title = {On Optimal Steering of Quantized Input Systems}, booktitle = {Proceedings of the NSF/ONR Workshop on Future Directions in Nonlinear Control of Mechanical Systems}, year = {2002}, address = {Urbana, IL.}, abstract = {

In this paper we consider the problem of optimal control (specifically, minimum-time steering) for systems with quantized inputs. In particular, we propose a new approach to the solution of the optimal control problem for an important class of nonlinear systems, i.e. chained-form systems. By exploiting results on the structure of the reachability set of these systems under quantized control, the optimal solution is determined solving an integer linear programming problem. Our algorithm represents an improvement with respect to classical approaches in terms of exactness, as it does not resort to any a priori state-space discretization. Although the computational complexity of the problem in our formulation is still formally exponential, it lends itself to application of Branch and Bound techniques, which substantially cuts down computations in many cases, as it has been experimentally observed.

}, keywords = {Embedded Control, Robotics}, author = {S. Pancanti and L. Pallottino and A. Bicchi} } @conference {PB00, title = {On the optimal conflict resolution for air traffic control}, booktitle = {Proc. IEEE Intelligent Transportation Systems}, year = {2000}, pages = {167-172}, address = {Dearborn, MI}, abstract = {

In this paper, we consider optimal resolution of air traffic conflicts. Aircraft are assumed to cruise within a given altitude layer, and are modeled as a kinematic system with velocity constraints and curvature bounds. Aircraft can not get closer to each other than a predefined safety distance. For such system of multiple aircraft, we consider the problem of planning optimal paths among given waypoints. Necessary conditions for optimality of solutions are derived, and used to devise a parameterization of possible trajectories that turns into efficient numerical solutions to the problem. Simulation results for a simplified aircraft conflict scenario are provided.

}, keywords = {Air Traffic Management Systems, Autonomous Vehicles, Navigation and Planning}, author = {L. Pallottino and A. Bicchi} } @article {BP00-TITS, title = {On optimal cooperative conflict resolution for air traffic management systems}, journal = {IEEE Trans. Intelligent Transportation Systems}, volume = {1}, number = {4}, year = {2000}, month = {December}, pages = {221-231}, abstract = {

In this paper, we consider optimal resolution of air traffic conflicts. Aircraft are assumed to cruise within a given altitude layer, and are modeled as a kinematic system with constant velocity and curvature bounds. Aircraft can not get closer to each other than a predefined safety distance. For such system of multiple aircraft, we consider the problem of planning optimal paths among given waypoints. Necessary conditions for optimality of solutions are derived, and used to devise a parameterization of possible trajectories that turns into efficient numerical solutions to the problem. Simulation results for a realistic aircraft conflict scenario are provided. A decentralized implementation of the optimal conflict resolution scheme is introduced that may allow free-flight coordination in a cooperative airspace management scheme. Impact of decentralization on performance and safety is finally discussed with the help of extensive simulations.

}, keywords = {Air Traffic Management Systems, Autonomous Vehicles, Hybrid and Embedded Control Systems, Nonlinear Control Systems}, author = {A. Bicchi and L. Pallottino} } @inbook {BP00-WAFR, title = {Optimal planning for coordinated vehicles with bounded curvature}, booktitle = {Algorithmic and Computational Robotics: New Directions}, volume = {1}, year = {2000}, note = {

The Workshop on Algorithmic Foundations of Robotics

}, pages = {167-172}, publisher = {A K Peters, MA}, organization = {A K Peters, MA}, abstract = {

In this paper we consider the problem of planning motions of a system of multiple vehicles moving in a plane. Each vehicle is modelled as a kinematic system with velocity constraints and curvature bounds. Vehicles can not get closer to each other than a predefined safety distance. For such system of multiple vehicles, we consider the problem of planning optimal paths in the absence of obstacles. The case when a constant distance between vehicles is enforced (such as when cooperative manipulation of objects is performed by the vehicle team) is also considered.

}, keywords = {Air Traffic Management Systems, Autonomous Vehicles, Navigation and Planning}, author = {A. Bicchi and L. Pallottino}, editor = {B. Donald and K. Lynch and D. Rus} }