23,422 research outputs found
A vision-guided parallel parking system for a mobile robot using approximate policy iteration
Reinforcement Learning (RL) methods enable autonomous robots to learn skills from scratch by interacting with the environment. However, reinforcement learning can be very time consuming. This paper focuses on accelerating the reinforcement learning process on a mobile robot in an unknown environment. The presented algorithm is based on approximate policy iteration with a continuous state space and a fixed number of actions. The action-value function is represented by a weighted combination of basis functions.
Furthermore, a complexity analysis is provided to show that the implemented approach is guaranteed to converge on an optimal policy with less computational time.
A parallel parking task is selected for testing purposes. In the experiments, the efficiency of the proposed approach is demonstrated and analyzed through a set of simulated and real robot experiments, with comparison drawn from two well known algorithms (Dyna-Q and Q-learning)
Recommended from our members
Evaluation of the implementation process of urban road pricing schemes in the United Kingdom and Italy
This paper is based upon detailed research that has taken place in the UK and Italy, on the implementation strategies for urban road pricing schemes. In the UK, both in London and Durham, the Road User Charging schemes required new legislation, and were implemented rapidly. The time from announcement to implementation took three years and the schemes were introduced after short periods of intensive planning, consultations and stakeholder networking. In Italy, the situation has been very different. The road pricing schemes in Rome and Genoa were not introduced under specific legislation but rather evolved from access control zones originally implemented in historic urban centres. The incremental introduction of the Italian road pricing experiments has taken approximately ten years.
The paper undertakes a comparison of these different strategies to introduce urban road pricing and the lessons they contain for the development of similar measures elsewhere. The comparison of the different implementing experiences is undertaken using Strategic Policy Niche Management, a method designed to explore, among other factors, the dynamics of the stakeholder networks involved in planning, introducing, marketing and managing radical urban Travel Demand Management policies
On the Effective Configuration of Planning Domain Models
The development of domain-independent planners
within the AI Planning community is leading to
âoff the shelfâ technology that can be used in a
wide range of applications. Moreover, it allows a
modular approach â in which planners and domain
knowledge are modules of larger software applications â that facilitates substitutions or improvements of individual modules without changing the rest of the system. This approach also supports the use of reformulation and configuration techniques, which transform how a model is represented in order to improve the efficiency of plan generation.
In this paper, we investigate how the performance
of planners is affected by domain model configuration. We introduce a fully automated method for this configuration task, and show in an extensive experimental analysis with six planners and seven domains that this process (which can, in principle, be combined with other forms of reformulation and configuration) can have a remarkable impact on performance across planners. Furthermore, studying the obtained domain model configurations can provide useful information to effectively engineer planning domain models
Semantics-based Automated Web Testing
We present TAO, a software testing tool performing automated test and oracle
generation based on a semantic approach. TAO entangles grammar-based test
generation with automated semantics evaluation using a denotational semantics
framework. We show how TAO can be incorporated with the Selenium automation
tool for automated web testing, and how TAO can be further extended to support
automated delta debugging, where a failing web test script can be
systematically reduced based on grammar-directed strategies. A real-life
parking website is adopted throughout the paper to demonstrate the effectivity
of our semantics-based web testing approach.Comment: In Proceedings WWV 2015, arXiv:1508.0338
Optimal path planning for surveillance with temporal-logic constraints
In this paper we present a method for automatically generating optimal robot paths satisfying high-level mission specifications. The motion of the robot in the environment is modeled as a weighted transition system. The mission is specified by an arbitrary linear temporal-logic (LTL) formula over propositions satisfied at the regions of a partitioned environment. The mission specification contains an optimizing proposition, which must be repeatedly satisfied. The cost function that we seek to minimize is the maximum time between satisfying instances of the optimizing proposition. For every environment model, and for every formula, our method computes a robot path that minimizes the cost function. The problem is motivated by applications in robotic monitoring and data-gathering. In this setting, the optimizing proposition is satisfied at all locations where data can be uploaded, and the LTL formula specifies a complex data-collection mission. Our method utilizes BĂźchi automata to produce an automaton (which can be thought of as a graph) whose runs satisfy the temporal-logic specification. We then present a graph algorithm that computes a run corresponding to the optimal robot path. We present an implementation for a robot performing data collection in a road-network platform.This material is based upon work supported in part by ONR-MURI (award N00014-09-1-1051), ARO (award W911NF-09-1-0088), and Masaryk University (grant numbers LH11065 and GD102/09/H042), and other funding sources (AFOSR YIP FA9550-09-1-0209, NSF CNS-1035588, NSF CNS-0834260). (N00014-09-1-1051 - ONR-MURI; W911NF-09-1-0088 - ARO; LH11065 - Masaryk University; GD102/09/H042 - Masaryk University; FA9550-09-1-0209 - AFOSR YIP; CNS-1035588 - NSF; CNS-0834260 - NSF
Urban road user charging and workplace parking levies
In this chapter we will briefly describe the provision made for the introduction of road user charging and workplace parking levies in the Transport Act 2000 and equivalent legislation for London and Scotland. After reviewing the background to these provisions, we will discuss the practical issues and policy questions which arise for any local authority wishing to take advantage of their new powers. Our discussion will draw attention to developments that have occurred since the passing of the Act and conclude on the prospects for charging schemes in the UK
ASAP: An Automatic Algorithm Selection Approach for Planning
Despite the advances made in the last decade in automated planning, no planner out-
performs all the others in every known benchmark domain. This observation motivates
the idea of selecting different planning algorithms for different domains. Moreover, the
plannersâ performances are affected by the structure of the search space, which depends
on the encoding of the considered domain. In many domains, the performance of a plan-
ner can be improved by exploiting additional knowledge, for instance, in the form of
macro-operators or entanglements.
In this paper we propose ASAP, an automatic Algorithm Selection Approach for
Planning that: (i) for a given domain initially learns additional knowledge, in the form
of macro-operators and entanglements, which is used for creating different encodings
of the given planning domain and problems, and (ii) explores the 2 dimensional space
of available algorithms, defined as encodingsâplanners couples, and then (iii) selects the
most promising algorithm for optimising either the runtimes or the quality of the solution
plans
- âŚ