Abstract
The objective of this research is to develop a general methodology to manage conflicts and errors (CEs). Two constraint-based conflict and error prevention and detection (CEPD) algorithms, centralized and decentralized algorithms, have been designed. These two algorithms model and utilize the relationship between CEs for effective CEPD. They are compared with the traditional CEPD algorithm over undirected and directed constraint networks. Experiments results show that the two CEPD algorithms outperform the traditional CEPD algorithm in terms of four performance measures. The decentralized CEPD algorithm shall be used to manage CEs over a large constraint network. If information transmission between distributed agents is not feasible for the decentralized CEPD algorithm, the centralized CEPD algorithm shall be used for CEPD. The centralized CEPD algorithm, however, is sensitive to network topology and information transmission time.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
