Refine
Year of publication
Institute
Language
- English (132) (remove)
Document Type
- Article (65)
- Conference Proceeding (59)
- Part of a Book (6)
- Book (2)
Keywords
- Anomaly detection (1)
- Automation (1)
- Autonomous mobile robots (1)
- Benchmark (1)
- Computational modeling (1)
- Control (1)
- Datasets (1)
- GPU (1)
- Heuristic algorithms (1)
- Industry 4.0 (1)
In this paper we present an extension of the action language Golog that allows for using fuzzy notions in non-deterministic argument choices and the reward function in decision-theoretic planning. Often, in decision-theoretic planning, it is cumbersome to specify the set of values to pick from in the non-deterministic-choice-of-argument statement. Also, even for domain experts, it is not always easy to specify a reward function. Instead of providing a finite domain for values in the non-deterministic-choice-of-argument statement in Golog, we now allow for stating the argument domain by simply providing a formula over linguistic terms and fuzzy uents. In Golog’s forward-search DT planning algorithm, these formulas are evaluated in order to find the agent’s optimal policy. We illustrate this in the Diner Domain where the agent needs to calculate the optimal serving order.
20 Years of RoboCup
(2016)
The Carologistics team participates in the RoboCup Logistics League for the seventh year. The RCLL requires precise vision,
manipulation and path planning, as well as complex high-level decision
making and multi-robot coordination. We outline our approach with an
emphasis on recent modifications to those components.
The team members in 2018 are David Bosen, Christoph Gollok, Mostafa
Gomaa, Daniel Habering, Till Hofmann, Nicolas Limpert, Sebastian Schönitz,
Morian Sonnet, Carsten Stoffels, and Tarik Viehmann.
This paper is based on the last year’s team description.
One central challenge for self-driving cars is a proper path-planning. Once a trajectory has been found, the next challenge is to accurately and safely follow the precalculated path. The model-predictive controller (MPC) is a common approach for the lateral control of autonomous vehicles. The MPC uses a vehicle dynamics model to predict the future states of the vehicle for a given prediction horizon. However, in order to achieve real-time path control, the computational load is usually large, which leads to short prediction horizons. To deal with the computational load, the control algorithm can be parallelized on the graphics processing unit (GPU). In contrast to the widely used stochastic methods, in this paper we propose a deterministic approach based on grid search. Our approach focuses on systematically discovering the search area with different levels of granularity. To achieve this, we split the optimization algorithm into multiple iterations. The best sequence of each iteration is then used as an initial solution to the next iteration. The granularity increases, resulting in smooth and predictable steering angle sequences. We present a novel GPU-based algorithm and show its accuracy and realtime abilities with a number of real-world experiments.
This summer, RoboCup competitions were held for the 20th time in Leipzig, Germany. It was the second time that RoboCup took place in Germany, 10 years after the 2006 RoboCup in Bremen. In this article, we give an overview on the latest developments of RoboCup and what happened in the different leagues over the last decade. With its 20th edition, RoboCup clearly is a success story and a role model for robotics competitions. From our personal view point, we acknowledge this by giving a retrospection about what makes RoboCup such a success.