The past decade witnessed rapid development of constraint satisfaction technologies, where algorithms are now able to cope with larger and harder problems. However, owing to the fact that constraints are inherently de...The past decade witnessed rapid development of constraint satisfaction technologies, where algorithms are now able to cope with larger and harder problems. However, owing to the fact that constraints are inherently declarative, attention is quickly turning toward developing high-level programming languages within which such problems can be modeled and also solved. Along these lines, this paper presents DEPICT, the language. Its use is illustrated through modeling a number of benchmark examples. The paper continues with a description of a prototype system within which such models may be interpreted. The paper concludes with a description of a sample run of this interpreter showing how a problem modeled as such is typically solved.展开更多
This research develops a solution method for project scheduling represented by a max-plus-linear (MPL) form. Max-plus-linear representation is an approach to model and analyze a class of discrete-event systems, in whi...This research develops a solution method for project scheduling represented by a max-plus-linear (MPL) form. Max-plus-linear representation is an approach to model and analyze a class of discrete-event systems, in which the behavior of a target system is represented by linear equations in max-plus algebra. Several types of MPL equations can be reduced to a constraint satisfaction problem (CSP) for mixed integer programming. The resulting formulation is flexible and easy-to-use for project scheduling;for example, we can obtain the earliest output times, latest task-starting times, and latest input times using an MPL form. We also develop a key method for identifying critical tasks under the framework of CSP. The developed methods are validated through a numerical example.展开更多
In order to realize spacecraft autonomy activity duration and complex temporal relations must be taken into consideration. In the space mission planning system, the traditional planners are unable to describe this kno...In order to realize spacecraft autonomy activity duration and complex temporal relations must be taken into consideration. In the space mission planning system, the traditional planners are unable to describe this knowledge, so an object-oriented temporal knowledge representation method is proposed to model every activity as an object to describe the activity's duration, start-time, end-time and the temporal relations with other activities. The layered planning agent architecture is then designed for spacecraft autonomous operation, and the functions of every component are given. A planning algorithm based on the temporal constraint satisfaction is built in detail using this knowledge representation and system architecture. The prototype of Deep Space Mission Autonomous Planning System is implemented. The results show that with the object-oriented temporal knowledge description method, the space mission planning system can be used to describe simultaneous activities, resource and temporal constraints, and produce a complete plan for exploration mission quickly under complex constraints.展开更多
The conflict detection and resolution in collaborative design is a key issue to maintain multi disciplinary design consistency. This paper proposes a new method for conflict detection and resolution based on constrain...The conflict detection and resolution in collaborative design is a key issue to maintain multi disciplinary design consistency. This paper proposes a new method for conflict detection and resolution based on constraint satisfaction technique. The representation of design constraint, the interval arithmetic of the constraint satisfaction problem CSP and the conflict resolution strategy based on constraint relaxation and adjustment are introduced. A constraint satisfaction based conflict detection and resolution tool CSCDR is then developed. It can help collaborative designers to detect and resolve the conflicts in time in the early stage of the design process so that the unnecessary design iteration and repeated negotiation are avoided and the design efficiency is then much improved. A design case illustrates the effectiveness of CSCDR.展开更多
游客管理是旅游目的地和景区管理的关键环节,对推动生态旅游资源的保护与可持续发展具有重要意义,通过对国外生态旅游游客管理研究情况进行分析。本研究运用CiteSpace软件,对Web of Science数据库中近30年收录的有关生态旅游游客管理方...游客管理是旅游目的地和景区管理的关键环节,对推动生态旅游资源的保护与可持续发展具有重要意义,通过对国外生态旅游游客管理研究情况进行分析。本研究运用CiteSpace软件,对Web of Science数据库中近30年收录的有关生态旅游游客管理方面的文献,进行关键词聚类和时间线视图分析国外生态旅游游客管理研究热点。结果表明:游客教育研究热点利用教育和宣传等手段,实现旅游目的地的可持续发展;游客行为约束通过游客指南、科普视频和语音解说等手段提升游客的环保意识,约束游客行为;游客安全管理利用解说牌和导游讲解等方式向游客传播安全知识,实现游客安全管理;游客对目的地管理的反馈是当前研究的热点,主要集中在评估游客满意度、环境保护措施、当地文化保护、参与度以及教育和信息传达等方面。据此,提出应该重视实施游客教育、加强游客行为管理、重视游客体验反馈等建议。展开更多
To overcome inefficiency in traditional logic programming, a declarative programming language COPS is designed based on the notion of concurrent constraint programming (CCP). The improvement is achieved by the adoptio...To overcome inefficiency in traditional logic programming, a declarative programming language COPS is designed based on the notion of concurrent constraint programming (CCP). The improvement is achieved by the adoption of constraint-based heuristic strategy and the introduction of deterministic components in the framework of CCP. Syntax specification and an operational semantic description are presented.展开更多
This study presents a decision-support tool for preliminary design of a horizontal wind turbine system. The function of this tool is to assist the various actors in making decisions about choices inherent to their act...This study presents a decision-support tool for preliminary design of a horizontal wind turbine system. The function of this tool is to assist the various actors in making decisions about choices inherent to their activities in the field of wind energy. Wind turbine cost and site characteristics are taken into account in the used models which are mainly based on the engineering knowledge. The present tool uses a constraint-modelling technique in combination with a CSP solver (numerical CSPs which are based on an arithmetic interval). In this way, it generates solutions and automatically performs the concept selection and costing of a given wind turbine. The data generated by the tool and required for decision making are: the quality index of solution (wind turbine), the amount of energy produced, the total cost of the wind turbine and the design variables which define the architecture of the wind turbine system. When applied to redesign a standard wind turbine in adequacy with a given site, the present tool proved both its ability to implement constraint modelling and its usefulness in conducting an appraisal.展开更多
In order to facilitate solution, a complex problem is normally decomposed into many small sub-problems during product development process. Teams are formed to resolve each sub-problem. The original problem is resolved...In order to facilitate solution, a complex problem is normally decomposed into many small sub-problems during product development process. Teams are formed to resolve each sub-problem. The original problem is resolved from solutions of sub-problems. Ideally, sub-problems are not only mutually independent but also inherent parameters of original problem. Solution of original problem can be directly derived from the collection of solutions from simplified sub-problems. In practice, the degree of interdependency is indeed reduced, sub-problems are neither totally independent nor all inherent parameters of original problem. This paper discusses team coordination under this condition and design solution from each team, which not only satisfies total requirements but also is an optimal one. The suggested optimized constraint decomposition method will insure workable Pareto solution.展开更多
Message passing algorithms,whose iterative nature captures complicated interactions among interconnected variables in complex systems and extracts information from the fixed point of iterated messages,provide a powerf...Message passing algorithms,whose iterative nature captures complicated interactions among interconnected variables in complex systems and extracts information from the fixed point of iterated messages,provide a powerful toolkit in tackling hard computational tasks in optimization,inference,and learning problems.In the context of constraint satisfaction problems(CSPs),when a control parameter(such as constraint density)is tuned,multiple threshold phenomena emerge,signaling fundamental structural transitions in their solution space.Finding solutions around these transition points is exceedingly challenging for algorithm design,where message passing algorithms suffer from a large message fiuctuation far from convergence.Here we introduce a residual-based updating step into message passing algorithms,in which messages with large variation between consecutive steps are given high priority in the updating process.For the specific example of model RB(revised B),a typical prototype of random CSPs with growing domains,we show that our algorithm improves the convergence of message updating and increases the success probability in finding solutions around the satisfiability threshold with a low computational cost.Our approach to message passing algorithms should be of value for exploring their power in developing algorithms to find ground-state solutions and understand the detailed structure of solution space of hard optimization problems.展开更多
In this paper, a computationally efficient method is proposed for automated design of the prefilters for multivariable systems. In quantitative feedback theory (QFT) method, proposed by Horowitz, the prefilter is de...In this paper, a computationally efficient method is proposed for automated design of the prefilters for multivariable systems. In quantitative feedback theory (QFT) method, proposed by Horowitz, the prefilter is designed to achieve the desired tracking specifications. In the proposed approach, we pose the prefilter design problem as an interval constraint satisfaction problem and solve it using the well-established interval constraint satisfaction techniques. The proposed method finds optimal values of the parameters of fixed structure prefilter within the initial search domain. An approach based on prefilter synthesis for single-input single-output is already developed. The purpose of this paper is to extend this approach to QFT prefilter design for general multivariable systems. To validate the above design approach, we applied the method to a laboratory setup of magnetic levitation system.展开更多
基金This work was supported by Lebanese National Council for Scientific Research.
文摘The past decade witnessed rapid development of constraint satisfaction technologies, where algorithms are now able to cope with larger and harder problems. However, owing to the fact that constraints are inherently declarative, attention is quickly turning toward developing high-level programming languages within which such problems can be modeled and also solved. Along these lines, this paper presents DEPICT, the language. Its use is illustrated through modeling a number of benchmark examples. The paper continues with a description of a prototype system within which such models may be interpreted. The paper concludes with a description of a sample run of this interpreter showing how a problem modeled as such is typically solved.
文摘This research develops a solution method for project scheduling represented by a max-plus-linear (MPL) form. Max-plus-linear representation is an approach to model and analyze a class of discrete-event systems, in which the behavior of a target system is represented by linear equations in max-plus algebra. Several types of MPL equations can be reduced to a constraint satisfaction problem (CSP) for mixed integer programming. The resulting formulation is flexible and easy-to-use for project scheduling;for example, we can obtain the earliest output times, latest task-starting times, and latest input times using an MPL form. We also develop a key method for identifying critical tasks under the framework of CSP. The developed methods are validated through a numerical example.
文摘In order to realize spacecraft autonomy activity duration and complex temporal relations must be taken into consideration. In the space mission planning system, the traditional planners are unable to describe this knowledge, so an object-oriented temporal knowledge representation method is proposed to model every activity as an object to describe the activity's duration, start-time, end-time and the temporal relations with other activities. The layered planning agent architecture is then designed for spacecraft autonomous operation, and the functions of every component are given. A planning algorithm based on the temporal constraint satisfaction is built in detail using this knowledge representation and system architecture. The prototype of Deep Space Mission Autonomous Planning System is implemented. The results show that with the object-oriented temporal knowledge description method, the space mission planning system can be used to describe simultaneous activities, resource and temporal constraints, and produce a complete plan for exploration mission quickly under complex constraints.
文摘The conflict detection and resolution in collaborative design is a key issue to maintain multi disciplinary design consistency. This paper proposes a new method for conflict detection and resolution based on constraint satisfaction technique. The representation of design constraint, the interval arithmetic of the constraint satisfaction problem CSP and the conflict resolution strategy based on constraint relaxation and adjustment are introduced. A constraint satisfaction based conflict detection and resolution tool CSCDR is then developed. It can help collaborative designers to detect and resolve the conflicts in time in the early stage of the design process so that the unnecessary design iteration and repeated negotiation are avoided and the design efficiency is then much improved. A design case illustrates the effectiveness of CSCDR.
文摘游客管理是旅游目的地和景区管理的关键环节,对推动生态旅游资源的保护与可持续发展具有重要意义,通过对国外生态旅游游客管理研究情况进行分析。本研究运用CiteSpace软件,对Web of Science数据库中近30年收录的有关生态旅游游客管理方面的文献,进行关键词聚类和时间线视图分析国外生态旅游游客管理研究热点。结果表明:游客教育研究热点利用教育和宣传等手段,实现旅游目的地的可持续发展;游客行为约束通过游客指南、科普视频和语音解说等手段提升游客的环保意识,约束游客行为;游客安全管理利用解说牌和导游讲解等方式向游客传播安全知识,实现游客安全管理;游客对目的地管理的反馈是当前研究的热点,主要集中在评估游客满意度、环境保护措施、当地文化保护、参与度以及教育和信息传达等方面。据此,提出应该重视实施游客教育、加强游客行为管理、重视游客体验反馈等建议。
文摘To overcome inefficiency in traditional logic programming, a declarative programming language COPS is designed based on the notion of concurrent constraint programming (CCP). The improvement is achieved by the adoption of constraint-based heuristic strategy and the introduction of deterministic components in the framework of CCP. Syntax specification and an operational semantic description are presented.
文摘This study presents a decision-support tool for preliminary design of a horizontal wind turbine system. The function of this tool is to assist the various actors in making decisions about choices inherent to their activities in the field of wind energy. Wind turbine cost and site characteristics are taken into account in the used models which are mainly based on the engineering knowledge. The present tool uses a constraint-modelling technique in combination with a CSP solver (numerical CSPs which are based on an arithmetic interval). In this way, it generates solutions and automatically performs the concept selection and costing of a given wind turbine. The data generated by the tool and required for decision making are: the quality index of solution (wind turbine), the amount of energy produced, the total cost of the wind turbine and the design variables which define the architecture of the wind turbine system. When applied to redesign a standard wind turbine in adequacy with a given site, the present tool proved both its ability to implement constraint modelling and its usefulness in conducting an appraisal.
基金Supportedby 86 3/CIMS (No .2 0 0 1AA4 1114 0 )andtheNationalNaturalScienceFoundationofChina (No .6 0 10 4 0 0 8)
文摘In order to facilitate solution, a complex problem is normally decomposed into many small sub-problems during product development process. Teams are formed to resolve each sub-problem. The original problem is resolved from solutions of sub-problems. Ideally, sub-problems are not only mutually independent but also inherent parameters of original problem. Solution of original problem can be directly derived from the collection of solutions from simplified sub-problems. In practice, the degree of interdependency is indeed reduced, sub-problems are neither totally independent nor all inherent parameters of original problem. This paper discusses team coordination under this condition and design solution from each team, which not only satisfies total requirements but also is an optimal one. The suggested optimized constraint decomposition method will insure workable Pareto solution.
基金supported by Guangdong Major Project of Basic and Applied Basic Research No.2020B0301030008Science and Technology Program of Guangzhou No.2019050001+2 种基金the Chinese Academy of Sciences Grant QYZDJ-SSWSYS018the National Natural Science Foundation of China(Grant No.12171479)supported by the National Natural Science Foundation of China(Grant Nos.11301339 and 11491240108)。
文摘Message passing algorithms,whose iterative nature captures complicated interactions among interconnected variables in complex systems and extracts information from the fixed point of iterated messages,provide a powerful toolkit in tackling hard computational tasks in optimization,inference,and learning problems.In the context of constraint satisfaction problems(CSPs),when a control parameter(such as constraint density)is tuned,multiple threshold phenomena emerge,signaling fundamental structural transitions in their solution space.Finding solutions around these transition points is exceedingly challenging for algorithm design,where message passing algorithms suffer from a large message fiuctuation far from convergence.Here we introduce a residual-based updating step into message passing algorithms,in which messages with large variation between consecutive steps are given high priority in the updating process.For the specific example of model RB(revised B),a typical prototype of random CSPs with growing domains,we show that our algorithm improves the convergence of message updating and increases the success probability in finding solutions around the satisfiability threshold with a low computational cost.Our approach to message passing algorithms should be of value for exploring their power in developing algorithms to find ground-state solutions and understand the detailed structure of solution space of hard optimization problems.
文摘In this paper, a computationally efficient method is proposed for automated design of the prefilters for multivariable systems. In quantitative feedback theory (QFT) method, proposed by Horowitz, the prefilter is designed to achieve the desired tracking specifications. In the proposed approach, we pose the prefilter design problem as an interval constraint satisfaction problem and solve it using the well-established interval constraint satisfaction techniques. The proposed method finds optimal values of the parameters of fixed structure prefilter within the initial search domain. An approach based on prefilter synthesis for single-input single-output is already developed. The purpose of this paper is to extend this approach to QFT prefilter design for general multivariable systems. To validate the above design approach, we applied the method to a laboratory setup of magnetic levitation system.