Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Philipp Robbel

dblp:43/9453 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2017
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Reinforcement learning · 40% Multi-agent systems · 31% Planning, search and constraint satisfaction · 29%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Multi-agent systems
multi-agent decision making
0.312017
The MADP Toolbox: An Open Source Library for Planning and Learning in (Multi-)Agent Systems · J. Mach. Learn. Res. 2017
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
multi-agent planning
0.312017
The MADP Toolbox: An Open Source Library for Planning and Learning in (Multi-)Agent Systems · J. Mach. Learn. Res. 2017
Knowledge, reasoning and agents › Multi-agent systems
partially observable stochastic games
0.312017
The MADP Toolbox: An Open Source Library for Planning and Learning in (Multi-)Agent Systems · J. Mach. Learn. Res. 2017
Machine learning › Reinforcement learning › dynamic programming
approximate linear programming
0.212016
Exploiting Anonymity in Approximate Linear Programming: Scaling to Large Multiagent MDPs · AAAI 2016
Machine learning › Reinforcement learning › markov decision process
factored MDP
0.212016
Exploiting Anonymity in Approximate Linear Programming: Scaling to Large Multiagent MDPs · AAAI 2016
Machine learning › Reinforcement learning
markov decision process
0.212016
Exploiting Anonymity in Approximate Linear Programming: Scaling to Large Multiagent MDPs · AAAI 2016
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › decision making under uncertainty
Multiagent MDPs
0.212016
Exploiting Anonymity in Approximate Linear Programming: Scaling to Large Multiagent MDPs · AAAI 2016

Methods — techniques the papers use, named apart from their topics

reinforcement learning · 0.3decision-theoretic planning · 0.3variable elimination · 0.2value function factorization · 0.2approximate linear programming · 0.2
YearPublicationVenuePosition
2017 The MADP Toolbox: An Open Source Library for Planning and Learning in (Multi-)Agent Systems
abstract
This article describes the Multiagent Decision Process (MADP) Toolbox, a software library to support planning and learning for intelligent agents and multiagent systems in uncertain environments. Key features are that it supports partially observable environments and stochastic transition models; has unified support for single- and multiagent systems; provides a large number of models for decision-theoretic decision making, including one-shot and sequential decision making under various assumptions of observability and cooperation, such as Dec-POMDPs and POSGs; provides tools and parsers to quickly prototype new problems; provides an extensive range of planning and learning algorithms for single- and multiagent systems; is released under the GNU GPL v3 license; and is written in C++ and designed to be extensible via the object-oriented paradigm.
Frans A. Oliehoek, Matthijs T. J. Spaan, Bas Terwijn, Philipp Robbel, João V. Messias
J. Mach. Learn. Res.4
2016 Exploiting Anonymity in Approximate Linear Programming: Scaling to Large Multiagent MDPs
abstract
Many solution methods for Markov Decision Processes (MDPs) exploit structure in the problem and are based on value function factorization. Especially multiagent settings, however, are known to suffer from an exponential increase in value component sizes as interactions become denser, restricting problem sizes and types that can be handled. We present an approach to mitigate this limitation for certain types of multiagent systems, exploiting a property that can be thought of as "anonymous influence" in the factored MDP. We show how representational benefits from anonymity translate into computational efficiencies, both for variable elimination in a factor graph and for the approximate linear programming solution to factored MDPs. Our methods scale to factored MDPs that were previously unsolvable, such as the control of a stochastic disease process over densely connected graphs with 50 nodes and 25 agents.
Philipp Robbel, Frans A. Oliehoek, Mykel J. Kochenderfer
AAAI1
2010 Exploiting feature dynamics for active object recognition
abstract
Abstract—This paper describes a new approach to object recognition for active vision systems that integrates information across multiple observations of an object. The approach exploits the order relationship between successive frames to derive a classifier based on the characteristic motion of local features across visual sweeps. This motion model reveals structural information about the object that can be exploited for recognition. The main contribution of this paper is a recognition system that extends invariant local features (shape contexts) into the time domain by integration of a motion model. Evaluations on one standardized and one custom collected dataset from the humanoid robot in our laboratory demonstrate that the motion model allows higherquality hypotheses about object categories quicker than a baseline system that treats object views as unordered streams of images. Index Terms—object recognition, active vision I.
Philipp Robbel, Deb Roy
ICARCV1