搜索结果: 1-7 共查到“Dynamic Programming”相关记录7条 . 查询时间(0.046 秒)
华南理工大学数据结构与算法课件Chapter13 Dynamic Programming
华南理工大学 数据结构 算法 课件 Chapter13 Dynamic Programming
2019/4/11
华南理工大学数据结构与算法课件Chapter13 Dynamic Programming。
Shrinking-horizon dynamic programming
dynamic programming model predictive control revenue management
2015/8/7
We describe a heuristic control policy, for a general finite-horizon stochastic control problem, that can be used when the current process disturbance is not conditionally independent of previous dist...
An Approximate Dynamic Programming Approach to Decentralized Control of Stochastic Systems
Decentralized Control Dynamic Programming
2015/6/19
we consider the problem of computing decentralized control policies for stochastic systems with finite state and action spaces. Synthesis of optimal decentralized policies for such problems is known t...
Dynamic Programming with Non-Classical Information Structures
Non-Classical Information Structures Programming
2015/6/19
We consider the problem of Partially Observed Markov Decision Processes with a non-classical information structure. Under a particular constraint on the information structure, optimal decision policie...
An Approximate Dynamic Programming Approach to the Dynamic Traveling Repairperson Problem
Traveling Repairperson Dynamic Programming
2015/6/19
This paper presents a novel suboptimal policy for the Dynamic Traveling Repairperson Problem~(m-DTRP), a problem requiring dynamic planning for a team of vehicles. The suggested policy is adaptive, lo...
Optimization-based Approximate Dynamic Programming
Approximate Dynamic Programming Approximate Linear Programming,
2014/12/18
Reinforcement learning algorithms hold promise in many complex domains, such as resource management and planning under uncertainty. Most reinforcement learning algorithms are iterative - they successi...
Convergence of Weighted Min-Sum Decoding Via Dynamic Programming on Trees
belief propagation max product min sum LDPC codes linear programming decoding
2011/9/9
Abstract: Applying the max-product (and belief-propagation) algorithms to loopy graphs is now quite popular for best assignment problems. This is largely due to their low computational complexity and ...