Thumbnail
Access Restriction
Subscribed

Author Balyo, T. ♦ Bartak, R. ♦ Surynek, P.
Source IEEE Xplore Digital Library
Content type Text
Publisher Institute of Electrical and Electronics Engineers, Inc. (IEEE)
File Format PDF
Copyright Year ©2012
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Special computer methods
Subject Keyword Planning ♦ Runtime ♦ Optimization ♦ Encoding ♦ Central Processing Unit ♦ Artificial intelligence ♦ Educational institutions ♦ makespan optimization ♦ planning
Abstract There exist planning algorithms that can quickly find sub-optimal plans even for large problems and planning algorithms finding optimal plans but only for smaller problems. In this paper we attempt to integrate both approaches. We present an anytime technique for improving plan quality, in particular for decreasing the plan make span, via substituting parts of the plan by make span-optimal sub-plans. The technique guarantees optimality, though it is primarily intended to quickly improve plan quality. We experimentally compare various approaches to local improvements and we show that our method has significantly better make span score than the SASE planner, which is one of the best optimal planners.
Description Author affiliation: Fac. of Math. & Phys., Charles Univ. in Prague Prague, Prague, Czech Republic (Balyo, T.; Bartak, R.; Surynek, P.)
ISBN 9781479902279
ISSN 10823409
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research ♦ Reading
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2012-11-07
Publisher Place Greece
Rights Holder Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Size (in Bytes) 1.11 MB
Page Count 7
Starting Page 1022
Ending Page 1028


Source: IEEE Xplore Digital Library