Resolving crises through automated bilateral negotiations

We describe the development of an automated agent that can negotiate efficiently with people in crises. The environment is characterized by two negotiators, time constraints, deadlines, full information, and the possibility of opting out. The agent can play either role, with communications via a pre-defined language. The model used in constructing the agent is based on a formal analysis of the crises scenario using game-theoretic methods and heuristics for bargaining. The agent receives messages sent by its opponent, analyzes them and responds. It also initiates discussion on one or more parameters of an agreement. Experimental results of simulations of a fishing dispute between Canada and Spain indicate that the agent played at least as well as, and in the case of Spain, significantly better than a human player.     

Quickly locating efficient, equitable deals in automated negotiations under two-sided information uncertainty

This paper develops an automated negotiation procedure inclusive of mechanism design and agent design for bilateral multi-issue negotiations under two-sided information uncertainty. The proposed negotiation mechanism comprises a protocol called MUP (Monotonic Utility-granting Protocol) and a matching strategy called WYDIWYG (What You Display Influences What You Get). The proposed preference elicitation procedure makes the agents faithful surrogates of the user they represent while the proposed Frontier Tracking Proposal Construction Algorithm (FTPCA) makes them learn the opponent's flexibility in negotiation and respond appropriately. The mechanism design and the agent design together help in locating efficient and equitable deals quickly. The efficiency, stability, simplicity, distribution symmetry and incentive compatibility of the proposed procedure are demonstrated through negotiation simulation experiments.     

语句相似度计算在主观题评判中的应用

在网络考试系统中对主观题自动评判运用自然语言识别技术是计算机领域的一个研究热点。结合中文分词方法,在基于《知网》知识库的词语相似度算法的基础上,运用数学上求解最优指派问题的匈牙利算法建立句子和句群的相似度计算模型,并根据句子相似度值给出主观题正确分数评判。     

Coherence measures and their relation to fuzzy similarity and inconsistency in knowledge bases

Intuitively it seems that the coherence of information received from heterogeneous sources should be one factor in determining the reliability or truthfulness of the information, yet the concept of coherence is extremely difficult to define. This paper draws on recent work on probabilistic measures of coherence by investigating two measures with contrasting properties and then explores how this work relates to similarity of fuzzy sets and comparison of knowledge bases in cases where inconsistency is present. In each area contrasting measures are proposed analogous to the probabilistic case. In particular, concepts of fuzzy and logical independence are proposed and in each area it is found that sensitivity to the relevant concept of independence is a distinguishing feature between the contrasting measures. In the case of inconsistent knowledge bases, it is argued that it is important to take agreeing information and not just conflicting and total information into account when comparing two knowledge bases. One of the measures proposed achieves this and is shown to have a number of properties which enable it to overcome some problems encountered by other approaches.     

A route and speed optimization model to find conflict-free routes for automated guided vehicles in large warehouses based on quick response code technology

This paper focuses on exploring conflict-free routes for automated guided vehicles (AGVs) based on quick response (QR) code technology. Intelligent warehousing has become an industrial development trend, with an increasing number of enterprises deploying AGVs based on QR code technology for transportation tasks, especially in large warehouses. Unlike the early single lane path following navigation systems, AGVs using QR code technology can freely switch tracks at any position. And two AGVs can be accommodated side by side. The conditions of conflict-free routes are analyzed firstly when AGVs use QR code navigation system. After that, a route and speed optimization model (RSOM) that aims at minimizing energy consumption and taking conflict-free routes with time windows as the constraint condition is established. Then a branch-and-bound (B&B) algorithm scheme is proposed by altering AGV routes or speed to arrive at schemes with conflict-free routes to complete transportation tasks. Lastly, the effectiveness and validity of our proposed model and algorithm are verified by numerical examples and a case study. The results show that resolving conflicts during route planning for AGVs guided through QR code have advantages over avoiding collision in the running phase by technology and path following techniques in both aspects of solution time and energy. In addition, the established B&B algorithm has better performance than the rapid-exploring random tree (RRT) algorithm in numerical examples. The gaps between them widen as the size of AGVs increases. The research work has potential for application to meet the requirements of AGV development.