• Title/Summary/Keyword: intelligent navigation system

Search Result 355, Processing Time 0.025 seconds

Development of One-to-One Shortest Path Algorithm Based on Link Flow Speeds on Urban Networks (도시부 가로망에서의 링크 통행속도 기반 One-to-One 최단시간 경로탐색 알고리즘 개발)

  • Kim, Taehyeong;Kim, Taehyung;Park, Bum-Jin;Kim, Hyoungsoo
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.11 no.5
    • /
    • pp.38-45
    • /
    • 2012
  • Finding shortest paths on time dependent networks is an important task for scheduling and routing plan and real-time navigation system in ITS. In this research, one-to-one time dependent shortest path algorithms based on link flow speeds on urban networks are proposed. For this work, first we select three general shortest path algorithms such as Graph growth algorithm with two queues, Dijkstra's algorithm with approximate buckets and Dijkstra's algorithm with double buckets. These algorithms were developed to compute shortest distance paths from one node to all nodes in a network and have proven to be fast and efficient algorithms in real networks. These algorithms are extended to compute a time dependent shortest path from an origin node to a destination node in real urban networks. Three extended algorithms are implemented on a data set from real urban networks to test and evaluate three algorithms. A data set consists of 4 urban street networks for Anaheim, CA, Baltimore, MD, Chicago, IL, and Philadelphia, PA. Based on the computational results, among the three algorithms for TDSP, the extended Dijkstra's algorithm with double buckets is recommended to solve one-to-one time dependent shortest path for urban street networks.

A Point-to-Point Shortest Path Search Algorithm for Digraph (방향그래프의 점대점 최단경로 탐색 알고리즘)

  • Lee, Sang-Un
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.17 no.7
    • /
    • pp.893-900
    • /
    • 2007
  • This paper suggests an algorithm that improves the disadvantages of the Dijkstra algorithm that is commonly used in GPS navigation system, searching for the shortest path. Dijkstra algorithm, first of all, requires much memory for the performance of the algorithm. It has to carry out number of node minus 1, since it determines the shortest path from all the nodes in the graph, starting from the first node. Therefore, Dijkstra algorithm might not be able to provide the information on every second, searching for the shortest path between the roads of the congested city and the destination. In order to solve these problems, this paper chooses a method of searching a number of nodes at once by means of choosing the shortest path of all the path nodes (select of minimum weight arc in-degree and out-degree), excluding the departure and destination nodes, and of choosing all the arcs that coincide with the shortest path of the path nodes, from all the node outgoing arcs starting from the departure node. On applying the suggested algorithm to 14 various digraphs, we succeeded to search the shortest path. In addition, the result was obtained at the speed of 2 to 3 times faster than that of Dijkstra algorithm, and the memory required was less than that of Dijkstra algorithm.

Road Sign Function Diversification Strategy to Respond to Changes in the Future Traffic Environment : Focusing on Citizens' Usability of Road Signs (미래 교통환경 변화 대응을 위한 도로표지 기능 다변화 전략: 시민의 도로표지 활용성을 중심으로)

  • Choi, Woo-Chul;Cheong, Kyu-Soo;Na, Joon-Yeop
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.21 no.3
    • /
    • pp.30-41
    • /
    • 2022
  • With the advent of autonomous driving, personal mobility, drones, and smart roads, it is necessary to respond to changes in the road traffic environment in the road guidance system. However, the use of road signs to guide the road is decreasing compared to the past due to the advent of devices such as navigation and smartphones. Therefore, in this study, a large-scale survey was conducted to derive road sign issues and usage plans to respond to future changes. Based on this, this study presented a strategy to diversify road sign functions by analyzing the factors affecting the use of road signs by citizens. As a result, first, it is necessary to provide real-time variable road guidance information that reflects user needs such as traffic, weather, and local events. Second, it is necessary to informatize digital road signs such as reflecting maps with precision. Third, it is necessary to demonstrate road guidance in a virtual environment that reflects various future mobility and road environments.

A Moving Object Query Process System for Mobile Recommendation Service (모바일 추천 서비스를 위한 이동 객체 질의 처리 시스템)

  • Park, Jeong-Seok;Shin, Moon-Sun;Ryu, Keun-Ho;Jung, Young-Jin
    • The KIPS Transactions:PartD
    • /
    • v.14D no.7
    • /
    • pp.707-718
    • /
    • 2007
  • Recently, much studies for providing mobile users with suitable and useful content services, LBS(Location Based Service) corresponding to the change of users' location, are actively going on. First and foremost, this is basically owing to the progress of location management technologies such as GPS, mobile communication technology and the spread of personal devices like PDA and the cellular phones. Besides, the research scope of LBS has been changed from vehicle tracking and navigation services to intelligent and personalized services considering the changing information of conditions or environment where the users' are located. For example, it inputs the information such as heavy traffic, pollution, and accidents. The query languages which effectively search the stored vehicle and environment information have been studied depending on the increase of the information utilization. However, most of existing moving object query languages are not enough to provide a recommendation service for a user, because they can not be tested and evaluated in real world and did not consider changed environment information. In order to retrieve not only a vehicle location and environment condition but also use them, we suggest a moving object query language for recommendation service and implement a moving object query process system for supporting a query language. It can process a nearest neighbor query for recommendation service which considers various attributes such as a vehicle's location and direction, environment information. It can be applied to location based service application which utilizes the recommended factors based on environmental conditions.

Learning Material Bookmarking Service based on Collective Intelligence (집단지성 기반 학습자료 북마킹 서비스 시스템)

  • Jang, Jincheul;Jung, Sukhwan;Lee, Seulki;Jung, Chihoon;Yoon, Wan Chul;Yi, Mun Yong
    • Journal of Intelligence and Information Systems
    • /
    • v.20 no.2
    • /
    • pp.179-192
    • /
    • 2014
  • Keeping in line with the recent changes in the information technology environment, the online learning environment that supports multiple users' participation such as MOOC (Massive Open Online Courses) has become important. One of the largest professional associations in Information Technology, IEEE Computer Society, announced that "Supporting New Learning Styles" is a crucial trend in 2014. Popular MOOC services, CourseRa and edX, have continued to build active learning environment with a large number of lectures accessible anywhere using smart devices, and have been used by an increasing number of users. In addition, collaborative web services (e.g., blogs and Wikipedia) also support the creation of various user-uploaded learning materials, resulting in a vast amount of new lectures and learning materials being created every day in the online space. However, it is difficult for an online educational system to keep a learner' motivation as learning occurs remotely, with limited capability to share knowledge among the learners. Thus, it is essential to understand which materials are needed for each learner and how to motivate learners to actively participate in online learning system. To overcome these issues, leveraging the constructivism theory and collective intelligence, we have developed a social bookmarking system called WeStudy, which supports learning material sharing among the users and provides personalized learning material recommendations. Constructivism theory argues that knowledge is being constructed while learners interact with the world. Collective intelligence can be separated into two types: (1) collaborative collective intelligence, which can be built on the basis of direct collaboration among the participants (e.g., Wikipedia), and (2) integrative collective intelligence, which produces new forms of knowledge by combining independent and distributed information through highly advanced technologies and algorithms (e.g., Google PageRank, Recommender systems). Recommender system, one of the examples of integrative collective intelligence, is to utilize online activities of the users and recommend what users may be interested in. Our system included both collaborative collective intelligence functions and integrative collective intelligence functions. We analyzed well-known Web services based on collective intelligence such as Wikipedia, Slideshare, and Videolectures to identify main design factors that support collective intelligence. Based on this analysis, in addition to sharing online resources through social bookmarking, we selected three essential functions for our system: 1) multimodal visualization of learning materials through two forms (e.g., list and graph), 2) personalized recommendation of learning materials, and 3) explicit designation of learners of their interest. After developing web-based WeStudy system, we conducted usability testing through the heuristic evaluation method that included seven heuristic indices: features and functionality, cognitive page, navigation, search and filtering, control and feedback, forms, context and text. We recruited 10 experts who majored in Human Computer Interaction and worked in the same field, and requested both quantitative and qualitative evaluation of the system. The evaluation results show that, relative to the other functions evaluated, the list/graph page produced higher scores on all indices except for contexts & text. In case of contexts & text, learning material page produced the best score, compared with the other functions. In general, the explicit designation of learners of their interests, one of the distinctive functions, received lower scores on all usability indices because of its unfamiliar functionality to the users. In summary, the evaluation results show that our system has achieved high usability with good performance with some minor issues, which need to be fully addressed before the public release of the system to large-scale users. The study findings provide practical guidelines for the design and development of various systems that utilize collective intelligence.

Hardware Approach to Fuzzy Inference―ASIC and RISC―

  • Watanabe, Hiroyuki
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1993.06a
    • /
    • pp.975-976
    • /
    • 1993
  • This talk presents the overview of the author's research and development activities on fuzzy inference hardware. We involved it with two distinct approaches. The first approach is to use application specific integrated circuits (ASIC) technology. The fuzzy inference method is directly implemented in silicon. The second approach, which is in its preliminary stage, is to use more conventional microprocessor architecture. Here, we use a quantitative technique used by designer of reduced instruction set computer (RISC) to modify an architecture of a microprocessor. In the ASIC approach, we implemented the most widely used fuzzy inference mechanism directly on silicon. The mechanism is beaded on a max-min compositional rule of inference, and Mandami's method of fuzzy implication. The two VLSI fuzzy inference chips are designed, fabricated, and fully tested. Both used a full-custom CMOS technology. The second and more claborate chip was designed at the University of North Carolina(U C) in cooperation with MCNC. Both VLSI chips had muliple datapaths for rule digital fuzzy inference chips had multiple datapaths for rule evaluation, and they executed multiple fuzzy if-then rules in parallel. The AT & T chip is the first digital fuzzy inference chip in the world. It ran with a 20 MHz clock cycle and achieved an approximately 80.000 Fuzzy Logical inferences Per Second (FLIPS). It stored and executed 16 fuzzy if-then rules. Since it was designed as a proof of concept prototype chip, it had minimal amount of peripheral logic for system integration. UNC/MCNC chip consists of 688,131 transistors of which 476,160 are used for RAM memory. It ran with a 10 MHz clock cycle. The chip has a 3-staged pipeline and initiates a computation of new inference every 64 cycle. This chip achieved an approximately 160,000 FLIPS. The new architecture have the following important improvements from the AT & T chip: Programmable rule set memory (RAM). On-chip fuzzification operation by a table lookup method. On-chip defuzzification operation by a centroid method. Reconfigurable architecture for processing two rule formats. RAM/datapath redundancy for higher yield It can store and execute 51 if-then rule of the following format: IF A and B and C and D Then Do E, and Then Do F. With this format, the chip takes four inputs and produces two outputs. By software reconfiguration, it can store and execute 102 if-then rules of the following simpler format using the same datapath: IF A and B Then Do E. With this format the chip takes two inputs and produces one outputs. We have built two VME-bus board systems based on this chip for Oak Ridge National Laboratory (ORNL). The board is now installed in a robot at ORNL. Researchers uses this board for experiment in autonomous robot navigation. The Fuzzy Logic system board places the Fuzzy chip into a VMEbus environment. High level C language functions hide the operational details of the board from the applications programme . The programmer treats rule memories and fuzzification function memories as local structures passed as parameters to the C functions. ASIC fuzzy inference hardware is extremely fast, but they are limited in generality. Many aspects of the design are limited or fixed. We have proposed to designing a are limited or fixed. We have proposed to designing a fuzzy information processor as an application specific processor using a quantitative approach. The quantitative approach was developed by RISC designers. In effect, we are interested in evaluating the effectiveness of a specialized RISC processor for fuzzy information processing. As the first step, we measured the possible speed-up of a fuzzy inference program based on if-then rules by an introduction of specialized instructions, i.e., min and max instructions. The minimum and maximum operations are heavily used in fuzzy logic applications as fuzzy intersection and union. We performed measurements using a MIPS R3000 as a base micropro essor. The initial result is encouraging. We can achieve as high as a 2.5 increase in inference speed if the R3000 had min and max instructions. Also, they are useful for speeding up other fuzzy operations such as bounded product and bounded sum. The embedded processor's main task is to control some device or process. It usually runs a single or a embedded processer to create an embedded processor for fuzzy control is very effective. Table I shows the measured speed of the inference by a MIPS R3000 microprocessor, a fictitious MIPS R3000 microprocessor with min and max instructions, and a UNC/MCNC ASIC fuzzy inference chip. The software that used on microprocessors is a simulator of the ASIC chip. The first row is the computation time in seconds of 6000 inferences using 51 rules where each fuzzy set is represented by an array of 64 elements. The second row is the time required to perform a single inference. The last row is the fuzzy logical inferences per second (FLIPS) measured for ach device. There is a large gap in run time between the ASIC and software approaches even if we resort to a specialized fuzzy microprocessor. As for design time and cost, these two approaches represent two extremes. An ASIC approach is extremely expensive. It is, therefore, an important research topic to design a specialized computing architecture for fuzzy applications that falls between these two extremes both in run time and design time/cost. TABLEI INFERENCE TIME BY 51 RULES {{{{Time }}{{MIPS R3000 }}{{ASIC }}{{Regular }}{{With min/mix }}{{6000 inference 1 inference FLIPS }}{{125s 20.8ms 48 }}{{49s 8.2ms 122 }}{{0.0038s 6.4㎲ 156,250 }} }}

  • PDF

Keyword-based networked knowledge map expressing content relevance between knowledge (지식 간 내용적 연관성을 표현하는 키워드 기반 네트워크형 지식지도 개발)

  • Yoo, Keedong
    • Journal of Intelligence and Information Systems
    • /
    • v.24 no.3
    • /
    • pp.119-134
    • /
    • 2018
  • A knowledge map as the taxonomy used in a knowledge repository should be structured to support and supplement knowledge activities of users who sequentially inquire and select knowledge for problem solving. The conventional knowledge map with a hierarchical structure has the advantage of systematically sorting out types and status of the knowledge to be managed, however it is not only irrelevant to knowledge user's process of cognition and utilization, but also incapable of supporting user's activity of querying and extracting knowledge. This study suggests a methodology for constructing a networked knowledge map that can support and reinforce the referential navigation, searching and selecting related and chained knowledge in term of contents, between knowledge. Regarding a keyword as the semantic information between knowledge, this research's networked knowledge map can be constructed by aggregating each set of knowledge links in an automated manner. Since a keyword has the meaning of representing contents of a document, documents with common keywords have a similarity in content, and therefore the keyword-based document networks plays the role of a map expressing interactions between related knowledge. In order to examine the feasibility of the proposed methodology, 50 research papers were randomly selected, and an exemplified networked knowledge map between them with content relevance was implemented using common keywords.

A Study on Design of Smart Home Service Robot McBot II (스마트 홈 서비스 로봇 맥봇II의 설계에 관한 연구)

  • Kim, Seung-Woo;Kim, Hi-Jun
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.12 no.4
    • /
    • pp.1824-1832
    • /
    • 2011
  • In this paper, a smart home service robot McBot II is newly developed in much more practical and intelligent system than McBot I which we had developed a few years ago. Thus far, vacuum-cleaners have lightened the burden of household chores but the operational labor that vacuum-cleaners entail has been very severe. Recently, a cleaning robot was commercialized to solve but it also was not successful because it still had the problem of mess-cleanup, which pertained to the clean-up of large trash and the arrangement of newspapers, clothes, etc. Hence, we develop a new home mess-cleanup robot McBot II to completely overcome this problem on real environments. The mechanical design and the basic control of McBot II, which performs mess-cleanup function etc. in house, is actually focused in this paper. McBot II is mechanically modeled in the same method that the human works in door by using the waist and the hands. The big-ranged vertical lift and the shoulder joints to be able to forward move are mechanically designed for the operating function as the human's waist when the robot works. The mobility of McBot II is designed in the holonomic mobile robot for the collision avoidance of obstacle and the high speed navigation on the small area in door. Finally, good performance of McBot II, which has been optimally desinged, is confirmed through the experimental results for the control of the robotic body, mobility, arms and hands in this paper.

Consideration of Technical Direction of Software Defined Vehicle Integration with C-ITS based on the analysis of In-Vehicle Infotainments (차량 인포테인먼트 아키텍처 분석 기반 향후 협력 지능형 교통 체계와 SDV 연동 방향성에 대한 고찰)

  • Joon-Young Kim;Young-Eun Kim;Won-Jun Ko
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.19 no.1
    • /
    • pp.149-156
    • /
    • 2024
  • The increased intelligence and speed of vehicle infotainment, whose main purpose was emergency and external communication, is showing the potential for application to various services such as navigation and autonomous driving. In particular, functionality for linking external devices and infrastructure is being strengthened due to advances in communication and networks. Under this trend, it is necessary to consider the direction of linkage with the cooperative intelligent transportation system (C-ITS) for advanced vehicle services and driving. In addition, in the case of automobiles, future vehicle development concepts are being established based on the concept of software-defined vehicles (SDVs) in line with the trend of electrification beyond telematics and infotainment advancements, and such SDV linkage must be considered at the same time. In this paper, we consider the future direction of ITS and SDV linkage based on analysis of vehicle infotainment structure. First, for this purpose, we analyze the existing vehicle infotainment structure and architecture, and also present the structure of the SDV linked to it. Based on this, analysis and implications are drawn on the possibility of applying and linking standard-based C-ITS services with SDV devices.

A Study on the Performance Verification Method of Small-Sized LTE-Maritime Transceiver (소형 초고속해상무선통신망 송수신기 성능 검증 방안에 관한 연구)

  • Seok Woo;Bu-young Kim;Woo-Seong Shim
    • Journal of the Korean Society of Marine Environment & Safety
    • /
    • v.29 no.7
    • /
    • pp.902-909
    • /
    • 2023
  • This study evaluated the performance test of a small-sized LTE-Maritime(LTE-M) transceiver that was developed and promoted to expand the use of intelligent maritime traf ic information services led by the Ministry of Oceans and Fisheries with the aim of supporting the prevention of maritime accidents. Accoriding to statistics, approximately 30% of all marine accidents in Korean water occur with ships weighing less than 3 tons. Therefore, the blind spots of maritime safety must be supplemented through the development of small-sized transceivers. The small transceiver may be used in fishing boats that are active near coastal waters and in water leisure equipment near the coastline. Therefore, verifying whether sufficient performance and stable communication quality are provided is necessary, considering the environment of their real usage. In this study, we reviewed the communication quality goals of the LTE-M network and the performance requirements of small-sized transceivers suggested by the Ministry of Oceans and Fisheries, and proposed a test plan to appropriately evaluate the performance of small-sized transceivers. The validity of the proposed test method was verified for six real-sea areas with a high frequency of marine accidents. Consequently, the downlink and uplink transmission speeds of the small-sized LTE-M transceiver showed performances of 9 Mbps or more and 3 Mbps or more, respectively. In addition, using the coverage analysis system, coverage of more than 95% and 100% were confirmed in the intensive management zone (0-30 km) and interesting zone (30-50 km), respectively. The performance evaluation method and test results proposed in this paper are expected to be used as reference materials for verifying the performance of transceivers, contributing to the spread of government-promoted e-navigation services and small-sized transceivers.