Conversion of MDP problems into heuristics based planning problems using temporal decomposition

Gillani, Rida; Nasir, Ali

doi:10.1109/ibcast.2016.7429874

Search citation statements

Order By: Relevance

Paper Sections

Select...

Proposed Complexity Reduction Techniques1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2021

Publication Types

Select...

Article1

Relationship

Self Cite1

Independent0

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The method of temporal decomposition 36 is a nontraditional method of decomposing an MDP problem as the size of the problem varies at different stages of the solution. Heuristics‐based planning techniques define the size of the sample space at any step.…”

Section: Proposed Complexity Reduction Techniquesmentioning

confidence: 99%

Computational complexity reduction algorithms for Markov decision process based vertical handoff in mobile networks

Gillani

Nasir

2021

Int J Communication

Self Cite

View full text Add to dashboard Cite

Summary Vertical handoff is a major concern in the operation of mobile connections. Multiple wireless networks collate to provide smooth and quality service to the users over mobile connections. This paper formulates a Markov decision process for handoff decisions with a sample space that includes a union of parameters that are important for making a handoff decision. The major contribution of this paper is to propose three different yet closely related algorithms for reducing the computational complexity of the original problem. In particular, we propose a feature‐wise assessment algorithm, a network‐wise assessment algorithm, and a hybrid approach for computational complexity reduction. Discussed algorithms give pseudo‐optimal solutions with a significant reduction in computational complexity. Results indicate that different complexity reduction algorithms perform best under different circumstances. This provides a guideline for the selection of complexity reduction algorithms based on real scenarios.

show abstract

Section: Proposed Complexity Reduction Techniquesmentioning

confidence: 99%