• Title/Summary/Keyword: Mobile Search

Search Result 766, Processing Time 0.026 seconds

Mobile Robots for the Concrete Crack Search and Sealing (콘크리트 크랙 탐색 및 실링을 위한 다수의 자율주행로봇)

  • Jin, Sung-Hun;Cho, Cheol-Joo;Lim, Kye-Young
    • The Journal of Korea Robotics Society
    • /
    • v.11 no.2
    • /
    • pp.60-72
    • /
    • 2016
  • This study proposes a multi-robot system, using multiple autonomous robots, to explore concrete structures and assist in their maintenance by sealing any cracks present in the structure. The proposed system employed a new self-localization method that is essential for autonomous robots, along with a visualization system to recognize the external environment and to detect and explore cracks efficiently. Moreover, more efficient crack search in an unknown environment became possible by arranging the robots into search areas divided depending on the surrounding situations. Operations with increased efficiency were also realized by overcoming the disadvantages of the infeasible logical behavioral model design with only six basic behavioral strategies based on distributed control-one of the methods to control swarm robots. Finally, this study investigated the efficiency of the proposed multi-robot system via basic sensor testing and simulation.

Mobile Agent Based Route Search Method Using Genetic Algorithm (유전 알고리즘을 이용한 이동 에이전트 기반의 경로 탐색 기법)

  • Ji, Hong-il;Moon, Seok-hwan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2014.10a
    • /
    • pp.599-602
    • /
    • 2014
  • Proposal algorithm in this thesis introduced cells, units of router group, for distributed processing of previous genetic algorithm. This thesis presented ways to reduce search delay time of overall network through cell-based genetic algorithm. With regard to procedures of proposal algorithm, duplicated agents were transferred to the point, where the second, third, and fourth cells were created in order, after the first cell was made, and the agents were engineered to search the shortest path to each cell, and then find the most efficient element through competition.

  • PDF

통신시장 유무선 서비스 도입과 주요국의 규제현황

  • 송영화
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2001.10a
    • /
    • pp.358-361
    • /
    • 2001
  • Fixed-mobile convergence services can be defined as the combination of previously separate fixed and mobile services, and networks and commercial practices. Examples of fixed-mobile convergence services include single voicemail box, single number and unified messaging across fixed and mobile networks. Recently as more voice is transferred to mobile networks, convergence services between fixed and mobile become more important. In Korea convergence services are only starting to become established, and are likely to become an important part of any operator's offering. In this paper, I search the different levels of fixed-mobile convergence services and the trends and regulations for fixed-mobile convergence services in major countries. And at the same time I also try to find a new direction of future regulatory principles related to fixed-mobile convergence services.

  • PDF

The VLR Overflow Control Scheme considering Mobility of Mobile Users in Wireless Mobile Networks

  • Oh, Sun-Jin
    • Journal of Korea Multimedia Society
    • /
    • v.6 no.4
    • /
    • pp.601-609
    • /
    • 2003
  • In wireless mobile networks, the service area is partitioned into several registration areas (RAs). Every RA is associated with a mobility database called Visitor Location Register (VLR). The VLR is used to achieve the location management of the mobile terminals. When a mobile terminal enters a new RA, the VLR stores the current location information of the mobile terminal before serving any mobile services. At that time, if the VLR is full, the registration procedure fails, and the system can not deliver services to the mobile user under the existing cellular technology To resolve this problem, we propose a VLR overflow control scheme considering mobility of mobile users to accomodate incoming users during VLR overflow. The performance of the proposed scheme is evaluated by an analytic model in terms of costs for the location search and the location update, and compared with those of the overflow control scheme proposed by Lin[1].

  • PDF

Development of A Pilot Android Application for Location-based Mobile Agricultural Information System (위치기반 모바일 농업정보시스템 구축을 위한 안드로이드 애플리케이션 시험 개발)

  • Kim, Sang Min;Jang, Min-Won
    • Journal of Korean Society of Rural Planning
    • /
    • v.20 no.4
    • /
    • pp.277-284
    • /
    • 2014
  • Recently the use of smart phones and mobile devices is increasing rapidly, data search and retrieval in the mobile environments are generalized. There are only few mobile applications available in the area of agriculture while huge amount of new applications are developed and uploaded. The purpose of this study was to develop the android based mobile application for providing agricultural infrastructure and disaster information. The mobile application was designed through the database establishment and management system, server management system, and mobile application development. The database is composed of weather data, agricultural infrastructure data, and agricultural disaster data. By developing the mobile application which provides agricultural infrastructure information, it is expected to improve the accessibility to agricultural information and mitigate the agricultural disaster damages.

Local Obstacle Avoidance Method of Mobile Robots Using LASER scanning sensor (레이저 스캐닝 센서를 이용한 이동 로봇의 지역 장애물 회피 방법)

  • Kim, Sung Cheol;Kang, Won Chan;Kim, Dong Ok;Seo, Dong Jin;Ko, Nak Yong
    • The Transactions of the Korean Institute of Electrical Engineers P
    • /
    • v.51 no.3
    • /
    • pp.155-160
    • /
    • 2002
  • This paper focuses on the problem of local obstacle avoidance of mobile robots. To solve this problem, the safety direction section search algorithm is suggested. This concept is mainly composed with non-collision section and collision section from the detecting area of laser scanning sensor. Then, we will search for the most suitable direction in these sections. The proposed local motion planning method is simple and requires less computation than others. An environment model is developed using the vector space concept to determine robot motion direction taking the target direction, obstacle configuration, and robot trajectory into account. Since the motion command is obtained considering motion dynamics, it results in smooth and fast as well as safe movement. Using the mobile base, the proposed obstacle avoidance method is tested, especially in the environment with pillar, wall and some doors. Also, the proposed autonomous motion planning and control algorithm are tested extensively. The experimental results show the proposed method yields safe and stable robot motion through the motion speed is not so fast.

A Study of Survivable Alternate Routing Algorithm (생존성있는 대체 경로 라우팅 알고리즘 연구)

  • Park, Young-Chul
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.13 no.7
    • /
    • pp.535-539
    • /
    • 2007
  • We study an degree of alternativeness and a survivability of alternate routing algorithm in mobile ad-hoc tactical communication networks. The common channel signaling scheme is used and flood search routing algorithm is used for analysis. We also study a connectivity performance for flood search routing, restricted flooding and hybrid routing. From the results we expect low blocking probabilities with alternate routing and the conventional flood search routing shows better connectivity performance which results in high survivability.

Robust architecture search using network adaptation

  • Rana, Amrita;Kim, Kyung Ki
    • Journal of Sensor Science and Technology
    • /
    • v.30 no.5
    • /
    • pp.290-294
    • /
    • 2021
  • Experts have designed popular and successful model architectures, which, however, were not the optimal option for different scenarios. Despite the remarkable performances achieved by deep neural networks, manually designed networks for classification tasks are the backbone of object detection. One major challenge is the ImageNet pre-training of the search space representation; moreover, the searched network incurs huge computational cost. Therefore, to overcome the obstacle of the pre-training process, we introduce a network adaptation technique using a pre-trained backbone model tested on ImageNet. The adaptation method can efficiently adapt the manually designed network on ImageNet to the new object-detection task. Neural architecture search (NAS) is adopted to adapt the architecture of the network. The adaptation is conducted on the MobileNetV2 network. The proposed NAS is tested using SSDLite detector. The results demonstrate increased performance compared to existing network architecture in terms of search cost, total number of adder arithmetics (Madds), and mean Average Precision(mAP). The total computational cost of the proposed NAS is much less than that of the State Of The Art (SOTA) NAS method.

Analysis of Cultural Context of Image Search with Deep Transfer Learning (심층 전이 학습을 이용한 이미지 검색의 문화적 특성 분석)

  • Kim, Hyeon-sik;Jeong, Jin-Woo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.24 no.5
    • /
    • pp.674-677
    • /
    • 2020
  • The cultural background of users utilizing image search engines has a significant impact on the satisfaction of the search results. Therefore, it is important to analyze and understand the cultural context of images for more accurate image search. In this paper, we investigate how the cultural context of images can affect the performance of image classification. To this end, we first collected various types of images (e.g,. food, temple, etc.) with various cultural contexts (e.g., Korea, Japan, etc.) from web search engines. Afterwards, a deep transfer learning approach using VGG19 and MobileNetV2 pre-trained with ImageNet was adopted to learn the cultural features of the collected images. Through various experiments we show the performance of image classification can be differently affected according to the cultural context of images.

Optimization of wire and wireless network using Global Search Algorithm (전역 탐색 알고리즘을 이용한 유무선망의 최적화)

  • 오정근;변건식
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2002.11a
    • /
    • pp.251-254
    • /
    • 2002
  • In the design of mobile wireless communication system, the location of BTS(Base Transciver Stations), RSC(Base Station Controllers), and MSC(Mobile Switching Center) is one of the most important parameters. Designing wireless communication system, the cost of equipment is need to be made low by combining various, complex parameters. We can solve this problem by combinatorial optimization algorithm, such as Simulated Annealing, Tabu Search, Genetic Algorithm, Random Walk Algorithm that have been extensively used for global optimization. This paper shows the four kind of algorithms which are applied to the location optimization of BTS, BSC, and MSC in designing mobile communication system and then we compare with these algorithms. And also we analyze the experimental results and shows the optimization process of these algorithms. As a the channel of a CDMA system is shared among several users, the receivers face the problem of multiple-access interference (MAI). Also, the multipath scenario leads to intersymbol interference (ISI). Both components are undesired, but unlike the additive noise process, which is usually completely unpredictable, their space-time structure helps to estimate and remove them.

  • PDF