EDBT 2026 Demo / reviewers in the wild / expert
Ranjit Nair
dblp:22/1638
· DBLP profile ↗
7ranked-venue papers
7as first author
0since 2021 · last 2005
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 7 · 7 first-authorGraphics, computer vision, multimedia, augmented reality and games · 3 · 3 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
3 papers |
Multi-agent systems · 50% Reinforcement learning · 38% Planning, search and constraint satisfaction · 13% | |
| Theoretical computer science
1 paper |
Mathematical optimization · 100% |
Topics — the 6 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Knowledge, reasoning and agents › Multi-agent systems
distributed constraint optimization |
0.1 | 1 | 2005 | Networked Distributed POMDPs: A Synergy of Distributed Constraint Optimization and POMDPs · IJCAI 2005 |
Mathematical optimization › distributed optimization
distributed constraint optimization |
0.1 | 1 | 2005 | Networked Distributed POMDPs: A Synthesis of Distributed Constraint Optimization and POMDPs · AAAI 2005 |
Machine learning › Reinforcement learning › multi-agent reinforcement learning › markov games
decentralized partially observable markov decision process |
0.0 | 1 | 2003 | Taming Decentralized POMDPs: Towards Efficient Policy Computation for Multiagent Settings · IJCAI 2003 |
Machine learning › Reinforcement learning
policy computation |
0.0 | 1 | 2003 | Taming Decentralized POMDPs: Towards Efficient Policy Computation for Multiagent Settings · IJCAI 2003 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › multi-agent planning
distributed planning |
0.0 | 1 | 2005 | Networked Distributed POMDPs: A Synergy of Distributed Constraint Optimization and POMDPs · IJCAI 2005 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
planning under uncertainty |
0.0 | 1 | 2003 | Taming Decentralized POMDPs: Towards Efficient Policy Computation for Multiagent Settings · IJCAI 2003 |
Methods — techniques the papers use, named apart from their topics
distributed constraint optimization · 0.2partially observable markov decision process · 0.1POMDP · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2005 | Networked Distributed POMDPs: A Synthesis of Distributed Constraint Optimization and POMDPs
Ranjit Nair, Pradeep Varakantham, Milind Tambe, Makoto Yokoo |
AAAI | 1 |
| 2005 | Networked Distributed POMDPs: A Synergy of Distributed Constraint Optimization and POMDPs
Ranjit Nair, Pradeep Varakantham, Milind Tambe, Makoto Yokoo |
IJCAI | 1 |
| 2005 | Hybrid BDI-POMDP Framework for Multiagent TeamingabstractMany current large-scale multiagent team implementations can be characterized as following the ``belief-desire-intention'' (BDI) paradigm, with explicit representation of team plans. Despite their promise, current BDI team approaches lack tools for quantitative performance analysis under uncertainty. Distributed partially observable Markov decision problems (POMDPs) are well suited for such analysis, but the complexity of finding optimal policies in such models is highly intractable. The key contribution of this article is a hybrid BDI-POMDP approach, where BDI team plans are exploited to improve POMDP tractability and POMDP analysis improves BDI team plan performance. Concretely, we focus on role allocation, a fundamental problem in BDI teams: which agents to allocate to the different roles in the team. The article provides three key contributions. First, we describe a role allocation technique that takes into account future uncertainties in the domain; prior work in multiagent role allocation has failed to address such uncertainties. To that end, we introduce RMTDP (Role-based Markov Team Decision Problem), a new distributed POMDP model for analysis of role allocations. Our technique gains in tractability by significantly curtailing RMTDP policy search; in particular, BDI team plans provide incomplete RMTDP policies, and the RMTDP policy search fills the gaps in such incomplete policies by searching for the best role allocation. Our second key contribution is a novel decomposition technique to further improve RMTDP policy search efficiency. Even though limited to searching role allocations, there are still combinatorially many role allocations, and evaluating each in RMTDP to identify the best is extremely difficult. Our decomposition technique exploits the structure in the BDI team plans to significantly prune the search space of role allocations. Our third key contribution is a significantly faster policy evaluation algorithm suited for our BDI-POMDP hybrid approach. Finally, we also present experimental results from two domains: mission rehearsal simulation and RoboCupRescue disaster rescue simulation. Ranjit Nair, Milind Tambe |
J. Artif. Intell. Res. | 1 |
| 2004 | Automated Assistants for Analyzing Team Behaviors
Ranjit Nair, Milind Tambe, Stacy Marsella, Taylor Raines |
Auton. Agents Multi Agent Syst. | 1 |
| 2003 | Taming Decentralized POMDPs: Towards Efficient Policy Computation for Multiagent Settings
Ranjit Nair, Milind Tambe, Makoto Yokoo, David V. Pynadath, Stacy Marsella |
IJCAI | 1 |
| 2002 | Team Formation for Reformation in Multiagent Domains Like RoboCupRescue
Ranjit Nair, Milind Tambe, Stacy Marsella |
RoboCup | 1 |
| 2001 | Task Allocation in the RoboCup Rescue Simulation Domain: A Short Note
Ranjit Nair, Takayuki Ito 0001, Milind Tambe, Stacy Marsella |
RoboCup | 1 |