7 research outputs found

    The Cost of Bounded Curvature

    Full text link
    We study the motion-planning problem for a car-like robot whose turning radius is bounded from below by one and which is allowed to move in the forward direction only (Dubins car). For two robot configurations σ,σ\sigma, \sigma', let (σ,σ)\ell(\sigma, \sigma') be the shortest bounded-curvature path from σ\sigma to σ\sigma'. For d0d \geq 0, let (d)\ell(d) be the supremum of (σ,σ)\ell(\sigma, \sigma'), over all pairs (σ,σ)(\sigma, \sigma') that are at Euclidean distance dd. We study the function \dub(d) = \ell(d) - d, which expresses the difference between the bounded-curvature path length and the Euclidean distance of its endpoints. We show that \dub(d) decreases monotonically from \dub(0) = 7\pi/3 to \dub(\ds) = 2\pi, and is constant for d \geq \ds. Here \ds \approx 1.5874. We describe pairs of configurations that exhibit the worst-case of \dub(d) for every distance dd

    The Curvature-Constrained Traveling Salesman Problem For High Point Densities

    No full text
    Abstract — We consider algorithms for the curvatureconstrained traveling salesman problem, when the nonholonomic constraint is described by Dubins ’ model. We indicate a proof of the NP-hardness of this problem. In the case of low point densities, i.e., when the Euclidean distances between the points are larger than the turning radius of the vehicle, various heuristics based on the Euclidean Traveling salesman problem are expected to perform well. In this paper we do not put a constraint on the minimum Euclidean distance. We show that any algorithm that computes a tour for the Dubins ’ vehicle following an ordering of points optimal for the Euclidean TSP cannot have an approximation ratio better than Ω(n), where n is the number of points. We then propose an algorithm that is not based on the Euclidean solution and seems to behave differently. For�this �algorithm, we obtain an approximation �1 ρ � � ρ � �� 2 guarantee of O min + ε logn, 1 + ε, where ρ is the minimum turning radius, and ε is the minimum Euclidean distance between any two points. I

    Performance optimization for unmanned vehicle systems

    Get PDF
    Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2008.Includes bibliographical references (p. 149-157).Technological advances in the area of unmanned vehicles are opening new possibilities for creating teams of vehicles performing complex missions with some degree of autonomy. Perhaps the most spectacular example of these advances concerns the increasing deployment of unmanned aerial vehicles (UAVs) in military operations. Unmanned Vehicle Systems (UVS) are mainly used in Information, Surveillance and Reconnaissance missions (ISR). In this context, the vehicles typically move about a low-threat environment which is sufficiently simple to be modeled successfully. This thesis develops tools for optimizing the performance of UVS performing ISR missions, assuming such a model.First, in a static environment, the UVS operator typically requires that a vehicle visit a set of waypoints once or repetitively, with no a priori specified order. Minimizing the length of the tour traveled by the vehicle through these waypoints requires solving a Traveling Salesman Problem (TSP). We study the TSP for the Dubins' vehicle, which models the limited turning radius of fixed wing UAVs. In contrast to previously proposed approaches, our algorithms determine an ordering of the waypoints that depends on the model of the vehicle dynamics. We evaluate the performance gains obtained by incorporating such a model in the mission planner.With a dynamic model of the environment the decision making level of the UVS also needs to solve a sensor scheduling problem. We consider M UAVs monitoring N > M sites with independent Markovian dynamics, and treat two important examples arising in this and other contexts, such as wireless channel or radar waveform selection. In the first example, the sensors must detect events arising at sites modeled as two-state Markov chains. In the second example, the sites are assumed to be Gaussian linear time invariant (LTI) systems and the sensors must keep the best possible estimate of the state of each site.(cont.) We first present a bound on the achievable performance which can be computed efficiently by a convex program, involving linear matrix inequalities in the LTI case. We give closed-form formulas for a feedback index policy proposed by Whittle. Comparing the performance of this policy to the bound, it is seen to perform very well in simulations. For the LTI example, we propose new open-loop periodic switching policies whose performance matches the bound.Ultimately, we need to solve the task scheduling and motion planning problems simultaneously. We first extend the approach developed for the sensor scheduling problems to the case where switching penalties model the path planning component. Finally, we propose a new modeling approach, based on fluid models for stochastic networks, to obtain insight into more complex spatiotemporal resource allocation problems. In particular, we give a necessary and sufficient stabilizability condition for the fluid approximation of the problem of harvesting data from a set of spatially distributed queues with spatially varying transmission rates using a mobile server.by Jerome Le Ny.Ph.D
    corecore