Implementasi Aplikasi Pencarian Rute Berbasis Top-K Shortest Path Dengan Keragaman Untuk Perangkat Bergerak

Shortest path merupakan rute dengan jarak atau total bobot terkecil dari suatu vertex ke vertex lain pada suatu graf. Masalah shortest path sendiri merupakan masalah umum yang dapat ditemukan pada kehidupan sehari-hari. Baik dalam navigasi sampai kepada routing pada jaringan. Banyak sekali algoritma yang dapat digunakan untuk mencari shortest path pada sebuah graf. Setiap jenis graf memiliki algoritma yang optimal dalam menyelesaikan masalah ini. Tujuan dari pembuatan tugas akhir ini adalah untuk mendesain algoritma yang dapat mencari k shortest path yang cukup berbeda antara satu dengan lainnya berdasarkan preferensi pengguna. Selain itu, algoritma ini dapat memberikan shortest path yang memenuhi kebutuhan dan keinginan pengguna karena adanya tag-tag yang dapat dimasukkan pengguna dalam pencarian shortest path. Tag-tag tersebut digunakan sebagai salah satu patokan dalam mengurutkan tingkat kesesuaian rute. Jadi, rute dengan jarak yang kecil, jika pengguna lebih menginginkan tagnya terpenuhi, bisa saja berada pada urutan yang rendah jika rute tersebut tidak memenuhi tag yang diberikan pengguna. ================================================================================================ Shortest path is a path with the shortest distance or total weight between two vertices within a graph. Shortest path problem itself is a general problem that can be found in daily life problem, Be it for navigation to network routing. There are many algorithms that have been implemented to find the shortest path within a graph, Each type of graph has its own algorithm that can be used to solved this problem optimally. The goals of this research is to design algorithm that can find k shortest path which diverse from each other based on user preferences. In addition, this algorithm can provide a shortest path that meets the needs and desires of users because of the tags that users can enter in searching for the shortest path. These tags are used as one of the criterions in order to sort the level of suitability of the path. So, a path with a small distance, if the user wants more tags to be fulfilled, could be in a low order if the path does not meet the tag given by the user

Motion Planning for Unlabeled Discs with Optimality Guarantees

We study the problem of path planning for unlabeled (indistinguishable) unit-disc robots in a planar environment cluttered with polygonal obstacles. We introduce an algorithm which minimizes the total path length, i.e., the sum of lengths of the individual paths. Our algorithm is guaranteed to find a solution if one exists, or report that none exists otherwise. It runs in time $\tilde{O}(m^4+m^2n^2)$, where $m$ is the number of robots and $n$ is the total complexity of the workspace. Moreover, the total length of the returned solution is at most $\text{OPT}+4m$, where OPT is the optimal solution cost. To the best of our knowledge this is the first algorithm for the problem that has such guarantees. The algorithm has been implemented in an exact manner and we present experimental results that attest to its efficiency

Chaining Test Cases for Reactive System Testing (extended version)

Testing of synchronous reactive systems is challenging because long input sequences are often needed to drive them into a state at which a desired feature can be tested. This is particularly problematic in on-target testing, where a system is tested in its real-life application environment and the time required for resetting is high. This paper presents an approach to discovering a test case chain---a single software execution that covers a group of test goals and minimises overall test execution time. Our technique targets the scenario in which test goals for the requirements are given as safety properties. We give conditions for the existence and minimality of a single test case chain and minimise the number of test chains if a single test chain is infeasible. We report experimental results with a prototype tool for C code generated from Simulink models and compare it to state-of-the-art test suite generators.Comment: extended version of paper published at ICTSS'1

Optimal Topology Design for Disturbance Minimization in Power Grids

The transient response of power grids to external disturbances influences their stable operation. This paper studies the effect of topology in linear time-invariant dynamics of different power grids. For a variety of objective functions, a unified framework based on $H_2$ norm is presented to analyze the robustness to ambient fluctuations. Such objectives include loss reduction, weighted consensus of phase angle deviations, oscillations in nodal frequency, and other graphical metrics. The framework is then used to study the problem of optimal topology design for robust control goals of different grids. For radial grids, the problem is shown as equivalent to the hard "optimum communication spanning tree" problem in graph theory and a combinatorial topology construction is presented with bounded approximation gap. Extended to loopy (meshed) grids, a greedy topology design algorithm is discussed. The performance of the topology design algorithms under multiple control objectives are presented on both loopy and radial test grids. Overall, this paper analyzes topology design algorithms on a broad class of control problems in power grid by exploring their combinatorial and graphical properties.Comment: 6 pages, 3 figures, a version of this work will appear in ACC 201