On the public citation graph

Point-based incremental pruning heuristic for solving finite-horizon DEC-POMDPs

0 signed · 38 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.1016/0004-3702(84)90004-3openalex-snapshot
General Branch and Bound, and its relation to A∗ and AO∗
inferredcites →https://doi.org/10.1126/science.153.3731.34openalex-snapshot
Dynamic Programming
inferredcites →https://doi.org/10.1145/1329125.1329388openalex-snapshot
Letting loose a SPIDER on a network of POMDPs
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.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.5555/1402383.1402455openalex-snapshot
Value-based observation compression for 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-78163-7_18openalex-snapshot
A Logic-Based Approach to Incremental Reasoning on Multi-agent Systems
inferred← citeshttps://doi.org/10.1007/978-3-662-44848-9_22openalex-snapshot
Error-Bounded Approximations for Infinite-Horizon Discounted Decentralized POMDPs
inferred← citeshttps://doi.org/10.1007/s10458-012-9204-yopenalex-snapshot
Solving decentralized POMDP problems using genetic algorithms
inferred← citeshttps://doi.org/10.1016/j.artint.2010.09.008openalex-snapshot
Online planning for multi-agent systems with bounded communication
inferred← citeshttps://doi.org/10.1016/j.egypro.2011.11.084openalex-snapshot
Green multi-agent planning framework: what and why
inferred← citeshttps://doi.org/10.1016/j.neucom.2016.01.031openalex-snapshot
Multi-agent reinforcement learning as a rehearsal for decentralized planning
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.2013.6630559openalex-snapshot
Automated model approximation for robotic navigation with POMDPs
inferred← citeshttps://doi.org/10.1109/robot.2010.5509494openalex-snapshot
Exploiting domain knowledge in planning for uncertain robot systems modeled as POMDPs
inferred← citeshttps://doi.org/10.1109/synasc.2015.68openalex-snapshot
Incremental Reasoning on Strongly Distributed Multi-agent Systems
inferred← citeshttps://doi.org/10.1109/wi-iat.2011.145openalex-snapshot
Social Model Shaping for Solving Generic DEC-POMDPs
inferred← citeshttps://doi.org/10.1609/aaai.v24i1.7616openalex-snapshot
Trial-Based Dynamic Programming for Multi-Agent Planning
inferred← citeshttps://doi.org/10.1609/aaai.v26i1.8257openalex-snapshot
Tree-Based Solution Methods for Multiagent POMDPs with Delayed Communication
inferred← citeshttps://doi.org/10.1609/aimag.v33i4.2402openalex-snapshot
Decision Making in Complex Multiagent Contexts: A Tale of Two Frameworks
inferred← citeshttps://doi.org/10.1609/icaps.v19i1.13355openalex-snapshot
Incremental Policy Generation for Finite-Horizon DEC-POMDPs
inferred← citeshttps://doi.org/10.1613/jair.3788openalex-snapshot
Incremental Clustering and Expansion for Faster Optimal Planning in Decentralized POMDPs
inferred← citeshttps://doi.org/10.1613/jair.3804openalex-snapshot
Incremental Clustering and Expansion for Faster Optimal Planning in Dec-POMDPs
inferred← citeshttps://doi.org/10.1613/jair.4623openalex-snapshot
Optimally Solving Dec-POMDPs as Continuous-State MDPs
inferred← citeshttps://doi.org/10.1613/jair.4649openalex-snapshot
Probabilistic Inference Techniques for Scalable Multiagent Decision Making
inferred← citeshttps://doi.org/10.48550/arxiv.1203.3474openalex-snapshot
Distribution over Beliefs for Memory Bounded Dec-POMDP Planning
inferred← citeshttps://doi.org/10.48550/arxiv.1203.3490openalex-snapshot
Anytime Planning for Decentralized POMDPs using Expectation Maximization
inferred← citeshttps://doi.org/10.48550/arxiv.1210.4865openalex-snapshot
Scaling Up Decentralized MDPs Through Heuristic Search
inferred← citeshttps://doi.org/10.5117/9789056296100openalex-snapshot
Value-Based Planning for Teams of Agents in Stochastic Partially Observable Environments
inferred← citeshttps://doi.org/10.5555/1838206.1838377openalex-snapshot
Point-based policy generation for decentralized POMDPs
inferred← citeshttps://doi.org/10.5555/1838206.1838378openalex-snapshot
Point-based backup for decentralized POMDPs: complexity and new algorithms
inferred← citeshttps://doi.org/10.65109/qkae8908openalex-snapshot
Exploiting separability in multiagent planning with continuous-state MDPs
inferred← citeshttps://doi.org/10.65109/rjma3901openalex-snapshot
Producing efficient error-bounded solutions for transition independent decentralized mdps
inferred← citeshttps://doi.org/10.70675/93dd72f8zb002z46a6za004z18bb41fe67c8openalex-snapshot
Utilisation de croyances heuristiques pour la planification multi-agent dans le cadre des Dec-POMDP
inferred← citeshttps://doi.org/10.70675/f24c470ezb099z4a59za9bfzf92adc6f6dceopenalex-snapshot
Distributed Embodied Evolutionary Adaptation of Behaviors in Swarms of Robotic Agents
inferred← citeshttps://doi.org/10.7275/n8e9-xy93openalex-snapshot
Decision-Theoretic Meta-reasoning in Partially Observable and Decentralized Settings
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.