Minton, S.; Johnston, M. D.; Philips, A.; and Laird, P. 1990. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Tracking Dynamic Team Activity - Tambe (1996) (29 citations) (Correct)
....path through the model, which provides a constraining context for its continued interpretations. Should this commitment lead to a tracking error, a real time repair mechanism is invoked. RESC is thus a repair based approach to tracking (like a repair based approach to constraint satisfaction (Minton et al. 1990)) A second key technique in RESC leads to its situatedness, i.e. ability to track the trackee s dynamic behaviors. A key assumption here is that the tracker is itself capable of the flexible and reactive behaviors required in this environment. That is, the tracker s architecture can execute such ....
....on the above, RESC team was modified so that roles in a team operator are assigned to subteams via CSP (unless the role assignment is known) So far, only arc consistency has been incorporated in RESC team . RESC team , being a repair based approach, solves this CSP via a repair based approach(Minton et al. 1990) it commits to one assignment of roles to subteams, and dynamically repairs inconsistent assignments. Minimum Cost Repair in Tracking Repairing role assignments to subteams is, however, more complex than indicated in the previous section. In particular, team tracking raises a novel issue ....
Minton, S.; Johnston, M. D.; Philips, A.; and Laird, P. 1990.
COMPOSER: A Case Based Reasoning System for Engineering Design - Purvis, Pu (1998) (2 citations) (Correct)
....et al. 1992) explores dynamic constraint propagation in continuous domains. Mittal and Falkenhainer (1990) identified four types of dynamic constraints and implemented them within an ATMS framework. Our research has identified a promising CSP algorithm called the minimum conflicts algorithm (Minton et al. 1992), whose empirical computational time has been shown to grow only linearly in the size of the problem, We have expanded this algorithm to include dynamic constraint capabilities and integrated it into the CBR framework as the adaptation algorithm. 2.3 Assembly Sequence Problems Assembly sequence ....
....system. This is especially true in complex domains such as engineering design, where it may not be immediately apparent how a set of cases should be combined to result in an effective new design product. For this reason, we have chosen a formal CSP algorithm, the minimum conflicts algorithm (Minton et al. 1992) to accomplish adaptation in our system. The issues that CSP addresses solve many of the inherent difficulties of adaptation. For instance, the CSP provides a common case representation, allowing cases from many different sources to be integrated seamlessly into a solution for a new problem. ....
[Article contains additional citation context not shown here]
Minton, S., Johnston, M., Philips, A., and Laird, P. (1992).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC