Talk:Preference-based planning: Difference between revisions

Revision as of 21:58, 5 October 2014

Latest revision as of 05:43, 17 February 2024

(4 intermediate revisions by 2 users not shown)

Line 1:

{{WikiProject Robotics|class=start|importance=low|attention=}}

{{dyktalk|28 June|2010|entry=... that '''[[preference-based planning]]''' can help you to plan your visit to [[Starbucks]] before going to school?}}

{{WikiProject banner shell|class=Start|

{{WikiProject Robotics|class=start |importance=low |attention=}}

{{WikiProject Computing |science=y |importance=low }}

}}

== Any policy against Product Placement? ==

Line 13 ⟶ 16:

Well ... how do problems in preference-based planning differ from [[weighted constraint satisfaction problem]]s? —[[User:Kri|Kri]] ([[User talk:Kri|talk]]) 21:58, 5 October 2014 (UTC)

:I think it's mainly the area of research: WCSPs are approached as a CSP with their algorithms and techniques whereas preference-based planning is more about planning a sequence of actions that satisfies preferences. So a WCSP is solved best (according to the constraints) based on its evaluation and a planning problem with preferences is solved best when the planning solution adheres to the preferences as best as possible (according to some formula). So there are similarities but a planning problem (needs sequence of actions) is not necessarily the same as a CSP (needs satisfying solution to constraints). - [[User:Simeon|Simeon]] ([[User talk:Simeon|talk]]) 22:48, 7 October 2014 (UTC)