On the public citation graph

Incremental Clustering and Expansion for Faster Optimal Planning in Decentralized POMDPs

0 signed · 147 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-540-74970-7_46openalex-snapshot
An LP-Based Heuristic for Optimal Planning
inferredcites →https://doi.org/10.1007/978-3-642-27645-3openalex-snapshot
Reinforcement Learning
inferredcites →https://doi.org/10.1007/s00500-008-0388-7openalex-snapshot
Using evolution strategies to solve DEC-POMDP problems
inferredcites →https://doi.org/10.1007/s10458-005-2631-2openalex-snapshot
Cooperative Multi-Agent Learning: The State of the Art
inferredcites →https://doi.org/10.1007/s10458-006-0008-9openalex-snapshot
Learning to communicate in a decentralized environment
inferredcites →https://doi.org/10.1007/s10458-007-9026-5openalex-snapshot
Formal models and algorithms for decentralized decision making under uncertainty
inferredcites →https://doi.org/10.1007/s10458-008-9064-7openalex-snapshot
Graphical models for interactive POMDPs: representations and solutions
inferredcites →https://doi.org/10.1007/s10458-009-9103-zopenalex-snapshot
Optimizing fixed-size stochastic controllers for POMDPs and decentralized POMDPs
inferredcites →https://doi.org/10.1007/s10458-010-9145-2openalex-snapshot
Solving efficiently Decentralized MDPs with temporal and resource constraints
inferredcites →https://doi.org/10.1007/s10458-012-9204-yopenalex-snapshot
Solving decentralized POMDP problems using genetic algorithms
inferredcites →https://doi.org/10.1016/b978-1-55860-377-6.50052-9openalex-snapshot
Learning policies for partially observable environments: Scaling up
inferredcites →https://doi.org/10.1016/c2009-0-27554-4openalex-snapshot
Distributed Artificial Intelligence
inferredcites →https://doi.org/10.1016/j.artint.2005.04.001openalex-snapshot
Processes and continuous change in a SAT-based planner
inferredcites →https://doi.org/10.1016/j.artint.2008.01.002openalex-snapshot
An approach to efficient planning with numerical fluents and multi-criteria plan quality
inferredcites →https://doi.org/10.1016/j.artint.2010.09.008openalex-snapshot
Online planning for multi-agent systems with bounded communication
inferredcites →https://doi.org/10.1016/j.artint.2011.05.001openalex-snapshot
Decentralized MDPs with sparse interactions
inferredcites →https://doi.org/10.1016/s0004-3702(02)00362-4openalex-snapshot
Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results
inferredcites →https://doi.org/10.1016/s0004-3702(02)00376-4openalex-snapshot
Equivalence notions and model minimization in Markov decision processes
inferredcites →https://doi.org/10.1016/s0004-3702(98)00023-xopenalex-snapshot
Planning and acting in partially observable stochastic domains
inferredcites →https://doi.org/10.1016/s0304-3975(98)00093-0openalex-snapshot
Enhanced A∗ algorithms for multiple alignments: optimal alignments for several sequences and k-opt approximate alignments for large cases
inferredcites →https://doi.org/10.1017/s0269888900001053openalex-snapshot
Integer optimization models of AI planning problems
inferredcites →https://doi.org/10.1017/s0269888901000017openalex-snapshot
Combining linear programming and satisfiability solving for resource planning
inferredcites →https://doi.org/10.1109/aamas.2004.100openalex-snapshot
Decentralized Markov Decision Processes with Event-Driven Interactions
inferredcites →https://doi.org/10.1109/aamas.2004.67openalex-snapshot
Approximate Solutions for Partially Observable Stochastic Games with Common Payoffs
inferredcites →https://doi.org/10.1109/aamas.2004.88openalex-snapshot
Communications for improving policy computation in distributed POMDPs
inferredcites →https://doi.org/10.1109/cdc.1996.574318openalex-snapshot
Decentralized control of a multiple access broadcast channel: performance bounds
inferredcites →https://doi.org/10.1109/robot.2005.1570273openalex-snapshot
Game Theoretic Control for Robot Teams
inferredcites →https://doi.org/10.1109/tac.1978.1101739openalex-snapshot
On delayed sharing patterns
inferredcites →https://doi.org/10.1109/tac.1982.1102924openalex-snapshot
Decentralized control of finite state Markov processes
inferredcites →https://doi.org/10.1109/tac.1985.1103988openalex-snapshot
On the complexity of decentralized decision making and detection problems
inferredcites →https://doi.org/10.1109/tro.2011.2161160openalex-snapshot
Chance-Constrained Optimal Path Planning With Obstacles
inferredcites →https://doi.org/10.1109/tsmcc.2007.913919openalex-snapshot
A Comprehensive Survey of Multiagent Reinforcement Learning
inferredcites →https://doi.org/10.1111/j.1467-8640.2008.01329.xopenalex-snapshot
ANALYZING MYOPIC APPROACHES FOR MULTI‐AGENT COMMUNICATION
inferredcites →https://doi.org/10.1137/0148063openalex-snapshot
The Multiple Sequence Alignment Problem in Biology
inferredcites →https://doi.org/10.1145/1082473.1082539openalex-snapshot
Multiagent coordination by Extended Markov Tracking
inferredcites →https://doi.org/10.1145/1082473.1082593openalex-snapshot
Reasoning about joint beliefs for execution-time communication decisions
inferredcites →https://doi.org/10.1145/1160633.1160678openalex-snapshot
Decentralized planning under uncertainty for teams of communicating agents
inferredcites →https://doi.org/10.1145/1160633.1160683openalex-snapshot
Winning back the CUP for distributed POMDPs
inferredcites →https://doi.org/10.1145/1329125.1329213openalex-snapshot
Exploiting factored representations for decentralized execution in multiagent teams
inferredcites →https://doi.org/10.1145/1329125.1329388openalex-snapshot
Letting loose a SPIDER on a network of POMDPs
inferredcites →https://doi.org/10.1145/1329125.1329389openalex-snapshot
On opportunistic techniques for solving decentralized Markov decision processes with temporal constraints
inferredcites →https://doi.org/10.1145/1329125.1329390openalex-snapshot
Q-value functions for decentralized POMDPs
inferredcites →https://doi.org/10.1145/375735.376469openalex-snapshot
Communication decisions in multi-agent cooperation
inferredcites →https://doi.org/10.1145/860575.860583openalex-snapshot
Transition-independent decentralized markov decision processes
inferredcites →https://doi.org/10.1145/860575.860598openalex-snapshot
Optimizing information exchange in cooperative multi-agent systems
inferredcites →https://doi.org/10.1145/860575.860816openalex-snapshot
The complexity of multiagent systems
inferredcites →https://doi.org/10.1287/moor.27.4.819.297openalex-snapshot
The Complexity of Decentralized Control of Markov Decision Processes
inferredcites →https://doi.org/10.1515/9781618117021openalex-snapshot
Landmarks Revisited
inferredcites →https://doi.org/10.1609/aaai.v24i1.7748openalex-snapshot
Finite-State Controllers Based on Mealy Machines for Centralized and Decentralized POMDPs
inferredcites →https://doi.org/10.1609/aaai.v25i1.8017openalex-snapshot
Utilizing Partial Policies for Identifying Equivalence of Behavioral Models
inferredcites →https://doi.org/10.1609/aaai.v26i1.8253openalex-snapshot
Influence-Based Abstraction for Multiagent Systems
inferredcites →https://doi.org/10.1609/aaai.v26i1.8257openalex-snapshot
Tree-Based Solution Methods for Multiagent POMDPs with Delayed Communication
inferredcites →https://doi.org/10.1609/aaai.v26i1.8405openalex-snapshot
Search Algorithms for m Best Solutions for Graphical Models
inferredcites →https://doi.org/10.1609/aimag.v22i3.1576openalex-snapshot
HEURISTIC SEARCH PLANNER 2.0
inferredcites →https://doi.org/10.1609/icaps.v19i1.13355openalex-snapshot
Incremental Policy Generation for Finite-Horizon DEC-POMDPs
inferredcites →https://doi.org/10.1609/icaps.v19i1.13369openalex-snapshot
Exploiting Coordination Locales in Distributed POMDPs via Social Model Shaping
inferredcites →https://doi.org/10.1609/icaps.v19i1.13370openalex-snapshot
Landmarks, Critical Paths and Abstractions: What's the Difference Anyway?
inferredcites →https://doi.org/10.1609/icaps.v19i1.13374openalex-snapshot
Extending the Use of Inference in Temporal Planning as Forwards Search
inferredcites →https://doi.org/10.1609/icaps.v20i1.13409openalex-snapshot
When Abstractions Met Landmarks
inferredcites →https://doi.org/10.1609/icaps.v20i1.13419openalex-snapshot
Influence-Based Policy Abstraction for Weakly-Coupled Dec-POMDPs
inferredcites →https://doi.org/10.1609/icaps.v21i1.13445openalex-snapshot
LPRPG-P: Relaxed Plan Heuristics for Planning with Preferences
inferredcites →https://doi.org/10.1613/jair.1024openalex-snapshot
The Communicative Multiagent Team Decision Problem: Analyzing Teamwork Theories and Models
inferredcites →https://doi.org/10.1613/jair.1129openalex-snapshot
PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains
inferredcites →https://doi.org/10.1613/jair.1156openalex-snapshot
SAPA: A Multi-objective Metric Temporal Planner
inferredcites →https://doi.org/10.1613/jair.1240openalex-snapshot
The 3rd International Planning Competition: Results and Analysis
inferredcites →https://doi.org/10.1613/jair.1427openalex-snapshot
Decentralized Control of Cooperative Systems: Categorization and Complexity Analysis
inferredcites →https://doi.org/10.1613/jair.1579openalex-snapshot
A Framework for Sequential Planning in Multi-Agent Settings
inferredcites →https://doi.org/10.1613/jair.1677openalex-snapshot
The Deterministic Part of IPC-4: An Overview
inferredcites →https://doi.org/10.1613/jair.1742openalex-snapshot
An Approach to Temporal Planning and Scheduling in Domains with Predictable Exogenous Events
inferredcites →https://doi.org/10.1613/jair.2443openalex-snapshot
Loosely Coupled Formulations for Automated Planning: An Integer Programming Perspective
inferredcites →https://doi.org/10.1613/jair.2567openalex-snapshot
Online Planning Algorithms for POMDPs
inferredcites →https://doi.org/10.1613/jair.2630openalex-snapshot
Monte Carlo Sampling Methods for Approximating Interactive POMDPs
inferredcites →https://doi.org/10.1613/jair.2667openalex-snapshot
Policy Iteration for Decentralized Control of Markov Decision Processes
inferredcites →https://doi.org/10.1613/jair.2915openalex-snapshot
An Investigation into Mathematical Programming for Finite Horizon Decentralized POMDPs
inferredcites →https://doi.org/10.1613/jair.3608openalex-snapshot
COLIN: Planning with Continuous Linear Numeric Change
inferredcites →https://doi.org/10.1613/jair.678openalex-snapshot
Value-Function Approximations for Partially Observable Markov Decision Processes
inferredcites →https://doi.org/10.1613/jair.855openalex-snapshot
The FF Planning System: Fast Plan Generation Through Heuristic Search
inferredcites →https://doi.org/10.21236/ada303260openalex-snapshot
Fast Planning Through Planning Graph Analysis.
inferredcites →https://doi.org/10.2139/ssrn.798944openalex-snapshot
Topologies on Types
inferredcites →https://doi.org/10.2200/s00091ed1v01y200705aim002openalex-snapshot
A Concise Introduction to Multiagent Systems and Distributed Artificial Intelligence
inferredcites →https://doi.org/10.2307/2291177openalex-snapshot
Markov Decision Processes: Discrete Stochastic Dynamic Programming.
inferredcites →https://doi.org/10.3233/aic-2009-0443openalex-snapshot
The role of AI planning as a decision support tool in power substation management
inferredcites →https://doi.org/10.48550/arxiv.1107.0025openalex-snapshot
Taming Numbers and Durations in the Model Checking Integrated Planning System
inferredcites →https://doi.org/10.48550/arxiv.1203.3490openalex-snapshot
Anytime Planning for Decentralized POMDPs using Expectation Maximization
inferredcites →https://doi.org/10.48550/arxiv.1203.3528openalex-snapshot
Rollout Sampling Policy Iteration for Decentralized POMDPs
inferredcites →https://doi.org/10.48550/arxiv.1206.5258openalex-snapshot
Optimizing Memory-Bounded Controllers for Decentralized POMDPs
inferredcites →https://doi.org/10.48550/arxiv.1206.5295openalex-snapshot
Improved Memory-Bounded Dynamic Programming for Decentralized POMDPs
inferredcites →https://doi.org/10.48550/arxiv.1207.1359openalex-snapshot
MAA*: A Heuristic Search Algorithm for Solving Decentralized POMDPs
inferredcites →https://doi.org/10.48550/arxiv.1302.1525openalex-snapshot
Incremental Pruning: A Simple, Fast, Exact Method for Partially Observable Markov Decision Processes
inferredcites →https://doi.org/10.5117/9789056296100openalex-snapshot
Value-Based Planning for Teams of Agents in Stochastic Partially Observable Environments
inferredcites →https://doi.org/10.5555/1402383.1402453openalex-snapshot
Not all agents are equal: scaling up distributed POMDPs for agent networks
inferredcites →https://doi.org/10.5555/1402383.1402455openalex-snapshot
Value-based observation compression for DEC-POMDPs
inferredcites →https://doi.org/10.5555/1402383.1402458openalex-snapshot
Interaction-driven Markov games for decentralized multiagent planning under uncertainty
inferredcites →https://doi.org/10.5555/1838206.1838377openalex-snapshot
Point-based policy generation for decentralized POMDPs
inferredcites →https://doi.org/10.5555/1838206.1838378openalex-snapshot
Point-based backup for decentralized POMDPs: complexity and new algorithms
inferredcites →https://doi.org/10.5555/2034396.2034405openalex-snapshot
Distributed model shaping for scaling to decentralized POMDPs with hundreds of agents
inferredcites →https://doi.org/10.5591/978-1-57735-516-8/ijcai11-338openalex-snapshot
Scaling up optimal heuristic search in Dec-POMDPs via incremental expansion
inferredcites →https://doi.org/10.65109/dxla8841openalex-snapshot
Reward shaping for valuing communications during multi-agent coordination
inferredcites →https://doi.org/10.65109/peqw2142openalex-snapshot
Constraint-based dynamic programming for decentralized POMDPs with structured interactions
inferredcites →https://doi.org/10.65109/qusu6255openalex-snapshot
Lossless clustering of histories in decentralized POMDPs
inferredcites →https://doi.org/10.65109/rjma3901openalex-snapshot
Producing efficient error-bounded solutions for transition independent decentralized mdps
inferredcites →https://doi.org/10.65109/xqlq5000openalex-snapshot
Exploiting locality of interaction in factored Dec-POMDPs
inferredcites →https://doi.org/10.65109/yget7348openalex-snapshot
Point-based incremental pruning heuristic for solving finite-horizon DEC-POMDPs

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-69322-0_12openalex-snapshot
Multi-agent Planning with High-Level Human Guidance
inferred← citeshttps://doi.org/10.1007/978-3-319-24309-2_29openalex-snapshot
Efficient Power-Aware Resource Constrained Scheduling and Execution for Planetary Rovers
inferred← citeshttps://doi.org/10.1007/978-3-319-67190-1_2openalex-snapshot
Interval Based Relaxation Heuristics for Numeric Planning with Action Costs
inferred← citeshttps://doi.org/10.1007/s10479-014-1652-0openalex-snapshot
Decentralized stochastic control
inferred← citeshttps://doi.org/10.1007/s10514-013-9375-7openalex-snapshot
Policy learning for autonomous feature tracking
inferred← citeshttps://doi.org/10.1016/j.artint.2014.12.008openalex-snapshot
Red–black planning: A new systematic approach to partial delete relaxation
inferred← citeshttps://doi.org/10.1016/j.artint.2016.12.002openalex-snapshot
State space search nogood learning: Online refinement of critical-path dead-end detectors in planning
inferred← citeshttps://doi.org/10.1016/j.eswa.2023.122820openalex-snapshot
A hybrid approach for expressive numeric and temporal planning with control parameters
inferred← citeshttps://doi.org/10.1109/cdc.2013.6760239openalex-snapshot
Decentralized control of partially observable Markov decision processes
inferred← citeshttps://doi.org/10.1109/icra.2015.7139350openalex-snapshot
Planning for decentralized control of multiple robots under uncertainty
inferred← citeshttps://doi.org/10.1177/0278364917739114openalex-snapshot
FFRob: Leveraging symbolic planning for efficient task and motion planning
inferred← citeshttps://doi.org/10.1515/9783111386690-004openalex-snapshot
513 Planen
inferred← citeshttps://doi.org/10.1609/aaai.v28i1.8892openalex-snapshot
Multiagent Metareasoning through Organizational Design
inferred← citeshttps://doi.org/10.1609/aaai.v30i1.10062openalex-snapshot
Towards Clause-Learning State Space Search: Learning to Recognize Dead-Ends
inferred← citeshttps://doi.org/10.1609/aaai.v30i1.10405openalex-snapshot
Solving Transition-Independent Multi-Agent MDPs with Sparse Interactions
inferred← citeshttps://doi.org/10.1609/aaai.v32i1.12082openalex-snapshot
Linear and Integer Programming-Based Heuristics for Cost-Optimal Numeric Planning
inferred← citeshttps://doi.org/10.1609/aaai.v34i09.7083openalex-snapshot
Let's Learn Their Language? A Case for Planning with Automata-Network Languages from Model Checking
inferred← citeshttps://doi.org/10.1609/aaai.v37i10.26428openalex-snapshot
Structurally Restricted Fragments of Numeric Planning – a Complexity Analysis
inferred← citeshttps://doi.org/10.1609/icaps.v28i1.13877openalex-snapshot
On Stubborn Sets and Planning with Resources
inferred← citeshttps://doi.org/10.1609/icaps.v31i1.15964openalex-snapshot
LM-cut and Operator Counting Heuristics for Optimal Numeric Planning with Simple Conditions
inferred← citeshttps://doi.org/10.1609/icaps.v34i1.31484openalex-snapshot
An Analysis of the Decidability and Complexity of Numeric Additive Planning
inferred← citeshttps://doi.org/10.1609/icaps.v34i1.31526openalex-snapshot
Learning Generalised Policies for Numeric Planning
inferred← citeshttps://doi.org/10.1609/socs.v6i1.18349openalex-snapshot
Red-Black Planning: A New Tractability Analysis and Heuristic Function
inferred← citeshttps://doi.org/10.1609/socs.v6i1.18372openalex-snapshot
Towards a Reformulation Based Approach for Efficient Numeric Planning: Numeric Outer Entanglements
inferred← citeshttps://doi.org/10.1609/socs.v7i1.18391openalex-snapshot
Partial Delete Relaxation, Unchained: On Intractable Red-Black Planning and Its Applications
inferred← citeshttps://doi.org/10.1613/jair.1.11213openalex-snapshot
Extending Classical Planning with State Constraints: Heuristics and Search for Optimal Planning
inferred← citeshttps://doi.org/10.1613/jair.1.11751openalex-snapshot
Planning for Hybrid Systems via Satisfiability Modulo Theories
inferred← citeshttps://doi.org/10.1613/jair.1.11829openalex-snapshot
Scalable Planning with Deep Neural Network Learned Transition Models
inferred← citeshttps://doi.org/10.1613/jair.1.11875openalex-snapshot
Subgoaling Techniques for Satisficing and Optimal Numeric Planning
inferred← citeshttps://doi.org/10.1613/jair.1.14034openalex-snapshot
The LM-Cut Heuristic Family for Optimal Numeric Planning with Simple Conditions
inferred← citeshttps://doi.org/10.1613/jair.4443openalex-snapshot
Deterministic Oversubscription Planning as Heuristic Search: Abstractions and Reformulations
inferred← citeshttps://doi.org/10.1613/jair.5057openalex-snapshot
Combining the Delete Relaxation with Critical-Path Heuristics: A Direct Characterization
inferred← citeshttps://doi.org/10.1613/jair.5153openalex-snapshot
Goal Probability Analysis in Probabilistic Planning: Exploring and Enhancing the State of the Art
inferred← citeshttps://doi.org/10.1613/jair.5306openalex-snapshot
Robots in Retirement Homes: Applying Off-the-Shelf Planning and Scheduling to a Team of Assistive Robots
inferred← citeshttps://doi.org/10.17638/02032540openalex-snapshot
Factored Upper Bounds for Multiagent Planning Problems under Uncertainty with Non-Factored Value Functions
inferred← citeshttps://doi.org/10.20381/ruor-20906openalex-snapshot
New Bandwidth Allocation Methods to Provide Quality-of-Experience Fairness for Video Streaming Services
inferred← citeshttps://doi.org/10.24963/ijcai.2017/104openalex-snapshot
Nonlinear Hybrid Planning with Deep Net Learned Transition Models and Mixed-Integer Linear Programming
inferred← citeshttps://doi.org/10.24963/ijcai.2017/614openalex-snapshot
Search and Learn: On Dead-End Detectors, the Traps they Set, and Trap Learning
inferred← citeshttps://doi.org/10.24963/ijcai.2018/660openalex-snapshot
Unchaining the Power of Partial Delete Relaxation, Part II: Finding Plans with Red-Black State Space Search
inferred← citeshttps://doi.org/10.24963/ijcai.2018/813openalex-snapshot
Interactive Learning and Decision Making: Foundations, Insights & Challenges
inferred← citeshttps://doi.org/10.3233/978-1-61499-419-0-441openalex-snapshot
“Distance”? Who Cares? Tailoring Merge-and-Shrink Heuristics to Detect Unsolvability
inferred← citeshttps://doi.org/10.3233/faia230409openalex-snapshot
Extracting and Exploiting Bounds of Numeric Variables for Optimal Linear Numeric Planning
inferred← citeshttps://doi.org/10.48550/arxiv.1310.4545openalex-snapshot
Decentralized stochastic control
inferred← citeshttps://doi.org/10.48550/arxiv.1502.05443openalex-snapshot
Influence-Optimistic Local Values for Multiagent Planning --- Extended Version
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.