490 research outputs found

    Shortest Route at Dynamic Location with Node Combination-Dijkstra Algorithm

    Get PDF
    Abstract— Online transportation has become a basic requirement of the general public in support of all activities to go to work, school or vacation to the sights. Public transportation services compete to provide the best service so that consumers feel comfortable using the services offered, so that all activities are noticed, one of them is the search for the shortest route in picking the buyer or delivering to the destination. Node Combination method can minimize memory usage and this methode is more optimal when compared to A* and Ant Colony in the shortest route search like Dijkstra algorithm, but can’t store the history node that has been passed. Therefore, using node combination algorithm is very good in searching the shortest distance is not the shortest route. This paper is structured to modify the node combination algorithm to solve the problem of finding the shortest route at the dynamic location obtained from the transport fleet by displaying the nodes that have the shortest distance and will be implemented in the geographic information system in the form of map to facilitate the use of the system. Keywords— Shortest Path, Algorithm Dijkstra, Node Combination, Dynamic Location (key words

    Goal-driven Collaborative Filtering

    Get PDF
    Recommender systems aim to identify interesting items (e.g. movies, books, websites) for a given user, based on their previously expressed preferences. As recommender systems grow in popularity, a notable divergence emerges between research practices and the reality of deployed systems: when recommendation algorithms are designed, they are evaluated in a relatively static context, mainly concerned about a predefined error measure. This approach disregards the fact that a recommender system exists in an environment where there are a number of factors that the system needs to satisfy, some of these factors are dynamic and can only be tackled over time. Thus, this thesis intends to study recommender systems from a goal-oriented point of view, where we define the recommendation goals, their associated measures and build the system accordingly. We first start with the argument that a single fixed measure, which is used to evaluate the system’s performance, might not be able to capture the multidimensional quality of a recommender system. Different contexts require different performance measures. We propose a unified error minimisation framework that flexibly covers various (directional) risk preferences. We then extend this by simultaneously optimising multiple goals, i.e., not only considering the predicted preference scores (e.g. ratings) but also dealing with additional operational or resource related requirements such as the availability, profitability or usefulness of a recommended item. We demonstrate multiple objectives through another example where a number of requirements, namely, diversity, novelty and serendipity are optimised simultaneously. At the end of the thesis, we deal with time-dependent goals. To achieve complex goals such as keeping the recommender model up-to-date over time, we consider a number of external requirements. Generally, these requirements arise from the physical nature of the system, such as available computational resources or available storage space. Modelling such a system over time requires describing the system dynamics as a combination of the underlying recommender model and its users’ behaviour. We propose to solve this problem by applying the principles of Modern Control Theory to construct and maintain a stable and robust recommender system for dynamically evolving environments. The conducted experiments on real datasets demonstrate that all the proposed approaches are able to cope with multiple objectives in various settings. These approaches offer solutions to a variety of scenarios that recommender systems might face

    PID controller design and tuning in networked control systems

    Get PDF
    Networked control systems (NCS) are distributed real-time computing and control systems with sensors, actuators and controllers that communicate over a shared medium. The distributed nature of NCS and issues related to the shared communication medium pose significant challenges for control design, as the control system no longer follows the rules of classical control theory. The main problems that are not well covered by the traditional control theory are varying time-delays due to communication and computation, and packet losses. During recent years, the control design of NCS and varying time-delay systems has been extensively researched. This investment has provided us with new results on stability. Often the proposed methods and solutions are far too complex for industrial use, especially if wireless automation applications are considered. The algorithms are computationally heavy, possibly requiring complete information from say, a network of hundreds or thousands of nodes. In the wireless case this is not feasible. The above justifies the use and research of simple controller structures and algorithms for NCS. Despite the growing interest towards more advanced control algorithms, the Proportional-Integral-Derivative (PID) controller still has a dominant status in the industry. Nevertheless, using PID for NCS has not been thoroughly investigated, especially with regard to controller tuning. This thesis proposes several PID tuning methods, which provide robustness against the challenges of NCS, namely varying time-delays (jitter) and packet loss. The doctoral thesis consists of a summary and eight publications that focus on the PID controller design, tuning and experimentation in NCS. The thesis includes a literature review of recent stability and control design results in NCS, a summary of publications and the original publications. The control design methods applied in the publications are also reviewed. In the thesis, several new methods for PID tuning in NCS are proposed. To make the methods usable, a PID tuning tool that implements one of the tuning methods is also developed. In order to verify the results of control design with real processes, the thesis suggests using the MoCoNet platform developed at the Helsinki University of Technology, Finland. The platform provides the tools for remote laboratory experiments in NCS settings. The results of the thesis indicate that the PID controller is well suited for NCS provided that the properties of the integrated communication and control system are taken into account in the tuning phase
    • …
    corecore