12,614 research outputs found
Building a Truly Distributed Constraint Solver with JADE
Real life problems such as scheduling meeting between people at different
locations can be modelled as distributed Constraint Satisfaction Problems
(CSPs). Suitable and satisfactory solutions can then be found using constraint
satisfaction algorithms which can be exhaustive (backtracking) or otherwise
(local search). However, most research in this area tested their algorithms by
simulation on a single PC with a single program entry point. The main
contribution of our work is the design and implementation of a truly
distributed constraint solver based on a local search algorithm using Java
Agent DEvelopment framework (JADE) to enable communication between agents on
different machines. Particularly, we discuss design and implementation issues
related to truly distributed constraint solver which might not be critical when
simulated on a single machine. Evaluation results indicate that our truly
distributed constraint solver works well within the observed limitations when
tested with various distributed CSPs. Our application can also incorporate any
constraint solving algorithm with little modifications.Comment: 7 page
International conference on software engineering and knowledge engineering: Session chair
The Thirtieth International Conference on Software Engineering and Knowledge Engineering (SEKE 2018) will be held at the Hotel Pullman, San Francisco Bay, USA, from July 1 to July 3, 2018. SEKE2018 will also be dedicated in memory of Professor Lofti Zadeh, a great scholar, pioneer and leader in fuzzy sets theory and soft computing.
The conference aims at bringing together experts in software engineering and knowledge engineering to discuss on relevant results in either software engineering or knowledge engineering or both. Special emphasis will be put on the transference of methods between both domains. The theme this year is soft computing in software engineering & knowledge engineering. Submission of papers and demos are both welcome
Policy conflict analysis for diffserv quality of service management
Policy-based management provides the ability to (re-)configure differentiated services networks so that desired Quality of Service (QoS) goals are achieved. This requires implementing network provisioning decisions, performing admission control, and adapting bandwidth allocation to emerging traffic demands. A policy-based approach facilitates flexibility and adaptability as policies can be dynamically changed without modifying the underlying implementation. However, inconsistencies may arise in the policy specification. In this paper we provide a comprehensive set of QoS policies for managing Differentiated Services (DiffServ) networks, and classify the possible conflicts that can arise between them. We demonstrate the use of Event Calculus and formal reasoning for the analysis of both static and dynamic conflicts in a semi-automated fashion. In addition, we present a conflict analysis tool that provides network administrators with a user-friendly environment for determining and resolving potential inconsistencies. The tool has been extensively tested with large numbers of policies over a range of conflict types
ILR Research in Progress 2013-14
The production of scholarly research continues to be one of the primary missions of the ILR School. During a typical academic year, ILR faculty members published or had accepted for publication over 25 books, edited volumes, and monographs, 170 articles and chapters in edited volumes, numerous book reviews. In addition, a large number of manuscripts were submitted for publication, presented at professional association meetings, or circulated in working paper form. Our faculty's research continues to find its way into the very best industrial relations, social science and statistics journals.Research_in_Progress_2013_14.pdf: 54 downloads, before Oct. 1, 2020
Sensor data fusion for the industrial artificial intelligence of things
The emergence of smart sensors, artificial intelligence, and deep learning technologies yield artificial intelligence of things, also known as the AIoT. Sophisticated cooperation of these technologies is vital for the effective processing of industrial sensor data. This paper introduces a new framework for addressing the different challenges of the AIoT applications. The proposed framework is an intelligent combination of multi-agent systems, knowledge graphs and deep learning. Deep learning architectures are used to create models from different sensor-based data. Multi-agent systems can be used for simulating the collective behaviours of the smart sensors using IoT settings. The communication among different agents is realized by integrating knowledge graphs. Different optimizations based on constraint satisfaction as well as evolutionary computation are also investigated. Experimental analysis is undertaken to compare the methodology presented to state-of-the-art AIoT technologies. We show through experimentation that our designed framework achieves good performance compared to baseline solutions.publishedVersio
Visual and interactive tool for product development process enhancement: towards intuitive support of co-located project review
Part 2: PLM EcosystemInternational audienceProduct life management refers to every method or tools which participate to the collaboration of actors involved along the product life. The main topic concerns the organization of this cycle by mastering the evolution between its various phases. Collaboration is a main bottleneck since every phase will involve different experts. The main issue in collaboration is to ensure a good understanding of requirements and constraints of collaborators and to manage conflicts between different experts. Negotiations are expected to solve potential conflicts. This is usually done in project review where the experts must converge towards a common solution. In this paper we investigate the efficiency of a tool formalizing and structuring the project review activity. This tool takes advantage of emerging technologies, here a multi-touch table. We illustrate the discussion with a use case concerning the development of personal computer housing
Multi-agent pathfinding for unmanned aerial vehicles
Unmanned aerial vehicles (UAVs), commonly known as drones, have become more and
more prevalent in recent years. In particular, governmental organizations and companies
around the world are starting to research how UAVs can be used to perform tasks such
as package deliver, disaster investigation and surveillance of key assets such as pipelines,
railroads and bridges. NASA is currently in the early stages of developing an air traffic
control system specifically designed to manage UAV operations in low-altitude airspace.
Companies such as Amazon and Rakuten are testing large-scale drone deliver services in
the USA and Japan.
To perform these tasks, safe and conflict-free routes for concurrently operating UAVs must
be found. This can be done using multi-agent pathfinding (mapf) algorithms, although
the correct choice of algorithms is not clear. This is because many state of the art mapf
algorithms have only been tested in 2D space in maps with many obstacles, while UAVs
operate in 3D space in open maps with few obstacles. In addition, when an unexpected
event occurs in the airspace and UAVs are forced to deviate from their original routes
while inflight, new conflict-free routes must be found. Planning for these unexpected
events is commonly known as contingency planning. With manned aircraft, contingency
plans can be created in advance or on a case-by-case basis while inflight. The scale at
which UAVs operate, combined with the fact that unexpected events may occur anywhere
at any time make both advanced planning and planning on a case-by-case basis impossible.
Thus, a new approach is needed. Online multi-agent pathfinding (online mapf) looks to
be a promising solution. Online mapf utilizes traditional mapf algorithms to perform path
planning in real-time. That is, new routes for UAVs are found while inflight.
The primary contribution of this thesis is to present one possible approach to UAV
contingency planning using online multi-agent pathfinding algorithms, which can be used
as a baseline for future research and development. It also provides an in-depth overview
and analysis of offline mapf algorithms with the goal of determining which ones are likely
to perform best when applied to UAVs. Finally, to further this same goal, a few different
mapf algorithms are experimentally tested and analyzed
Beyond Personalization: Research Directions in Multistakeholder Recommendation
Recommender systems are personalized information access applications; they
are ubiquitous in today's online environment, and effective at finding items
that meet user needs and tastes. As the reach of recommender systems has
extended, it has become apparent that the single-minded focus on the user
common to academic research has obscured other important aspects of
recommendation outcomes. Properties such as fairness, balance, profitability,
and reciprocity are not captured by typical metrics for recommender system
evaluation. The concept of multistakeholder recommendation has emerged as a
unifying framework for describing and understanding recommendation settings
where the end user is not the sole focus. This article describes the origins of
multistakeholder recommendation, and the landscape of system designs. It
provides illustrative examples of current research, as well as outlining open
questions and research directions for the field.Comment: 64 page
- …