CAPÍTULO 2: MARCO TEÓRICO
2.4. APRENDIZAJE COOPERATIVO
2.4.6. La EFyC en el AC
There are two types of task information that can be defined in the DCE, the task model and situated control rules (SCRs) . The task model is a hierarchy of tasks and sub-tasks that can be completed in a domain. It is constructed by selecting a set of conditions that signify a goal state and by identifying relevant sub-condition states that are important to the main goal for task completion. Conditions are selected by the author to comprise a task situation and the relevant preconditions from that situation are automatically generated and displayed to the author (Figure 6.23).
back_cover_closed
fe.x_on
fax off
soft sheet-under unit
back_co"Ver_open
unit_upside_dovn
Figure 6.23 : Building a task definition.
The most relevant conditions can be selected by the author and are highlighted in the task window (see unit_ups ide_down in Figure 6.23) .
Single conditions or groups of conditions can then be selected and decomposed into their own window with their own preconditions displayed. This process continues, enabling a hierarchy of goals and sub-
goals to be constructed. This is a top down process where the author starts with the first goal situation of a task and then breaks it down into it important components. This hierarchy can then be displayed to the author for verification (Figure 6.24). A task model template can then be generated for use with the GDI environment.
sofLsheeLunder_unlt back_couer _open faK_Off
uniLupside_down
Figure 6.24 : Displaying the task hierarchy.
The task model is only half the task information that can be specified by the author. SCRs can also be defined to provide local task pointers within a domain .
'
Goal cJeeniD&:_clolh_e:vailable tax off opeR.tion....P*nel_ clo3ed reedq_unit_dlny recomtn&�per_cover_open clean�n&_cloth_llV'Ililable tax off opeR.tionj)anel_openreed in&_ unit_dirty recol11q...Jlllper _cover_open
cJeeniD&:_clolh_e:vailable fax_off opeR.tion_penel_open
reedq_unit_dirty ol11�n&...Jlaper _cover _clo3ed
clean�n&_cloth_llV'Ililable tax on opeR.tion_ianel_cmed
reed in&_ unit_ dirty recom�n&�per_cover_clo3ed
clean�n&_cloth_avallable fax off opeR.oon....Penel_ clo3ed
reedln&_ unit_ dirty
clean�n&_cloth_avallable tax off operation..Panel_open
read in&_ unit_ clean
recol11tn&...Jlaper_cover_clo3ed
::.9:-..:
clean�n&_cloth_ avallable fax off operationj)anel_open
read in&_ unit_ clean recol11tn&...Jlaper_cover_open
ad. . . lean
reco:tn&
�
���
ver_open clean�n&_cloth_avallabletax off opeR.tion_j)anel_clo3ed
ree.dq_ unit_ clean recol11tn&_J)Ilper_cover_clo3ed
In the DCE, an author selects a start/initial situation for the generation of SCRs. A projection network from that position is then constructed. An interactive iterative deepening approach has been adopted for the construction of the projection network to allow partial projection networks to be generated at each iteration of the projection (see Appendix A ) . This has the advantage of allowing reduced projections to be presented to the user. As levels of the projection network are produced, they are displayed to the user who is then asked whether the current projection is adequate. If not, the projection can continue. Otherwise the projection algorithm is concluded (Figure 6.25). The use of reduced projections can shorten their generation time as it may not be necessary for the whole projection network to be generated.
If a node is selected in the projection network with the goal tool, the optimal path from the start node to this goal node is displayed. This path can be annotated on the projection network so that other relevant paths can be added or removed to allow the author to directly specify appropriate paths through the projection (Figure 6.26).
Seltet
�·-·-
Com.��: c�aning_cloth_availab� fex_off opere.tion__po.nel_closedreading_ unit_ dirty recoroing_paper _cover_ open
cleaning_cloth_availab� fex_off opere.tion_po.nel_open
reading_ unit_ dirty recoroing_paper_cover_open
cleaning_cloth_available fex_on opere.tion_po.nel_closed
reading_ unit_ dirty recoroing_paper_cover_clo3ed
cleaning_cloth_available fex off opere.tion__panel_closed
reading_ unit_ dirty
cleaning_cloth_availab� fex_off opere.tion_po.nel_open
reading_ unit_ clean recoroing_paper _cover_ closed
c�aning!
:'�
aavailab� opere.tion__io.nel_clo3edreco
nf:�
ap�';�!�
open!11111
cleaning_cloth_available cleaning_cloth_available
fex off !ex off
opere.tionj)anel_open opere.tion_panel_closed
reading_unit_clean reading_unit_clean
recoroing__paper_cover_open recoroing_paper_cover_clo3ed -(7
The paths selected by the author are used to generate SCRs for all the nodes on these paths. These SCRs can then be displayed to the author (Figure 6.27).
\21
Dtl.oto foH_off operotion_poneLclosed reoding_uniLdirty open_operotion_ponel cleoning_clo th_ouoiloble foH_off operotion_poneLopen reod i n g_uniLdirty cleon_reoding_unit r:::.i fOH_Off operotion_poneLopen reoding_uniLcleon close_operotion_ponellilili
Figure 6.27 : Displaying the SCRs.
The SCRs are displayed as pairs of text items. The top item is a set of conditions which need to be enabled in the current situation for the specific SCR to be relevant. The bottom item is the operator that should be followed in this situation. This is similar to the operator enablement in the POP tables, with the set of conditions acting as preconditions for the SCR operator.