Over-Subscription Planning with Numeric Goals

被引:0
|
作者
Benton, J. [1 ]
Do, Minh B.
Kambhampati, Subbarao [1 ]
机构
[1] Arizona State Univ, Comp Sci & Eng Dept, Tempe, AZ 85287 USA
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
By relaxing the hard-goal constraints from classical planning and associating them with reward values, over-subscription planning allows users to concentrate on presenting what they want and leaves the task of deciding the best goals to achieve to the planner. In this paper, we extend the over-subscription planning problem and its limited goal specification to allow numeric goals with continuous utility values and goals with mixed hard and soft constraints. Together they considerably extend the modeling power of goal specification and allow the user to express goal constraints that were not possible before. To handle these new goal constraints, we extend the Sapa(ps) planner's planning graph based techniques to help it choose the best beneficial subset of goals that can include both hard or soft logical and numeric goals. We also provide empirical results in several benchmark domains to demonstrate that our technique helps return quality plans.
引用
收藏
页码:1207 / 1213
页数:7
相关论文
共 50 条
  • [1] Effective approaches for partial satisfaction (over-subscription) planning
    van den Briel, M
    Sanchez, R
    Do, MB
    Kambhampati, S
    [J]. PROCEEDING OF THE NINETEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE SIXTEENTH CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2004, : 562 - 569
  • [2] Over-Subscription Planning with Boolean Optimization: An Assessment of State-of-the-Art Solutions
    Maratea, Marco
    Pulina, Luca
    [J]. AI(STAR)IA 2011: ARTIFICIAL INTELLIGENCE AROUND MAN AND BEYOND, 2011, 6934 : 420 - +
  • [3] Rural Internet Access: Over-Subscription Strategies, Regulation and Equilibrium
    Shin, SeungJae
    Weiss, Martin B.
    Tucci, Jack
    [J]. MANAGERIAL AND DECISION ECONOMICS, 2007, 28 (01) : 1 - 12
  • [4] ROSE: Cluster Resource Scheduling via Speculative Over-subscription
    Sun, Xiaoyang
    Hu, Chunming
    Yang, Renyu
    Garraghan, Peter
    Wo, Tianyu
    Xu, Jie
    Zhu, Jianyong
    Li, Chao
    [J]. 2018 IEEE 38TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS (ICDCS), 2018, : 949 - 960
  • [5] Virtual Network Embedding in Hybrid Data Center Networks with Over-Subscription
    Li, Zhenhua
    Yang, Yuanyuan
    [J]. 2018 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2018,
  • [6] A game-theoretic model of underpricing and over-subscription in Chinese IPO's
    Geertsema, Paul
    Lu, Helen
    [J]. FINANCE RESEARCH LETTERS, 2016, 17 : 93 - 96
  • [7] Design and Implementation of Burst Buffer Over-Subscription Scheme for HPC Storage Systems
    Bang, Jiwoo
    Sim, Alexander
    Lockwood, Glenn K. K.
    Eom, Hyeonsang
    Sung, Hanul
    [J]. IEEE ACCESS, 2023, 11 : 3386 - 3401
  • [8] BBOS: Efficient HPC Storage Management via Burst Buffer Over-Subscription
    Sung, Hanul
    Bang, Jiwoo
    Kim, Chungyong
    Kim, Hyung-Sin
    Sim, Alexander
    Lockwood, Glenn K.
    Eom, Hyeonsang
    [J]. 2020 20TH IEEE/ACM INTERNATIONAL SYMPOSIUM ON CLUSTER, CLOUD AND INTERNET COMPUTING (CCGRID 2020), 2020, : 142 - 151
  • [9] Explaining over-subscription in fixed-price IPOs - Evidence from the Malaysian stock market
    Low, Soo-Wah
    Yong, Othman
    [J]. EMERGING MARKETS REVIEW, 2011, 12 (03) : 205 - 216
  • [10] An Autonomous Architecture for Managing Vertical Elasticity in the IaaS Cloud Using Memory Over-Subscription
    Riad, Bouaita
    Abdelhafid, Zitouni
    Ramdane, Maamri
    [J]. APPLIED COMPUTATIONAL INTELLIGENCE AND MATHEMATICAL METHODS: COMPUTATIONAL METHODS IN SYSTEMS AND SOFTWARE 2017, VOL. 2, 2018, 662 : 50 - 61