أعرض تسجيلة المادة بشكل مبسط

dc.contributor Fern, Alan
dc.contributor Tadepalli, Prasad
dc.contributor Wong, Weng-Keen
dc.contributor Pavol, Mike
dc.date 2007-07-24T16:27:47Z
dc.date 2007-07-24T16:27:47Z
dc.date 2007-06-15
dc.date 2007-07-24T16:27:47Z
dc.date.accessioned 2013-10-16T07:55:02Z
dc.date.available 2013-10-16T07:55:02Z
dc.date.issued 2013-10-16
dc.identifier http://hdl.handle.net/1957/6170
dc.identifier.uri http://koha.mediu.edu.my:8181/xmlui/handle/1957/6170
dc.description Graduation date: 2008
dc.description Domain-independent automated planning is concerned with computing a sequence of actions that can transform an initial state into a desired goal state. Resource production domains form an interesting class of such problems, in that they typically require reasoning about concurrent durative-actions with continuous effects while minimizing some cost function. Although formulating planning problems as instances of SAT has proven to be very successful within the realm of STRIPS planning problems, where states and time are discrete and actions are instantaneous, it is unclear whether the same success can be transferred to resource production. Some of the major drawbacks to these systems are that they do not support reasoning about metric quantities, continuous time, and cost functions. TM-LPSAT was one of the first successful systems to reason about both metric quantities and continuous time within a SAT framework. However, TM-LPSAT does not provide a way to reason about cost functions. In this thesis, we extend the framework in a way that allows it to be capable of minimizing the costs, in our case makespans, of the plans that it finds.
dc.language en_US
dc.subject AI
dc.subject SAT
dc.subject Planning
dc.subject Resource Production
dc.title A SAT-based planning framework for optimizing resource production
dc.type Thesis


الملفات في هذه المادة

الملفات الحجم الصيغة عرض

لا توجد أي ملفات مرتبطة بهذه المادة.

هذه المادة تبدو في المجموعات التالية:

أعرض تسجيلة المادة بشكل مبسط