3,349 research outputs found

    Batch Informed Trees (BIT*): Informed Asymptotically Optimal Anytime Search

    Full text link
    Path planning in robotics often requires finding high-quality solutions to continuously valued and/or high-dimensional problems. These problems are challenging and most planning algorithms instead solve simplified approximations. Popular approximations include graphs and random samples, as respectively used by informed graph-based searches and anytime sampling-based planners. Informed graph-based searches, such as A*, traditionally use heuristics to search a priori graphs in order of potential solution quality. This makes their search efficient but leaves their performance dependent on the chosen approximation. If its resolution is too low then they may not find a (suitable) solution but if it is too high then they may take a prohibitively long time to do so. Anytime sampling-based planners, such as RRT*, traditionally use random sampling to approximate the problem domain incrementally. This allows them to increase resolution until a suitable solution is found but makes their search dependent on the order of approximation. Arbitrary sequences of random samples approximate the problem domain in every direction simultaneously and but may be prohibitively inefficient at containing a solution. This paper unifies and extends these two approaches to develop Batch Informed Trees (BIT*), an informed, anytime sampling-based planner. BIT* solves continuous path planning problems efficiently by using sampling and heuristics to alternately approximate and search the problem domain. Its search is ordered by potential solution quality, as in A*, and its approximation improves indefinitely with additional computational time, as in RRT*. It is shown analytically to be almost-surely asymptotically optimal and experimentally to outperform existing sampling-based planners, especially on high-dimensional planning problems.Comment: International Journal of Robotics Research (IJRR). 32 Pages. 16 Figure

    Beyond revealed preference: choice-theoretic foundations for behavioral welfare economics

    Get PDF
    We propose a broad generalization of standard choice-theoretic welfare economics that encompasses a wide variety of nonstandard behavioral models. Our approach exploits the coherent aspects of choice that those positive models typically attempt to capture. It replaces the standard revealed preference relation with an unambiguous choice relation: roughly, x is (strictly) unambiguously chosen over y (written xP*y) iff y is never chosen when x is available. Under weak assumptions, P* is acyclic and therefore suitable for welfare analysis; it is also the most discerning welfare criterion that never overrules choice. The resulting framework generates natural counterparts for the standard tools of applied welfare economics and is easily applied in the context of specific behavioral theories, with novel implications. Though not universally discerning, it lends itself to principled refinements

    A Context-Aware and Preference-Driven Vacation Planner for Tourism Regions

    Get PDF
    Taking a Preference SQL approach, a context-aware vacation planner for on-site activities is proposed to automatically generate vacation plans based on user preferences and situational aspects. Using different levels of abstraction, the result of the corresponding preference queries is always optimal and the result size is minimal. It consists of stereotype-specific and contextaware activities which are combined to create daily or even multi-day plans of activities. The correctness, completeness and optimality are assured by a preference calculus of strict partial orders. User preferences are initially collected and defined by a feedback questionnaire. The application is modelled by adequate preference compositions and the Preference SQL runtime system efficiently evaluates the resulting preference queries. The prototype proves that soft runtime requirements are met. Initial tests with real data from the industry-leading outdooractive platform indicate that the database-driven preference technology can successfully be employed to provide added value for vacation planning
    • …
    corecore