• Title/Summary/Keyword: Max-Coverage algorithm

Search Result 3, Processing Time 0.131 seconds

Combine Harvest Scheduling Program for Rough Rice using Max-coverage Algorithm

  • Lee, Hyo-Jai;Kim, Oui-Woung;Kim, Hoon;Han, Jae-Woong
    • Journal of Biosystems Engineering
    • /
    • v.38 no.1
    • /
    • pp.18-24
    • /
    • 2013
  • Purpose: This study was conducted to develop an optimal combine scheduling program using Max-Coverage algorithm which derives the maximum efficiency for a specific location in harvest seasons. Methods: The combine scheduling program was operated with information about combine specification and farmland. Four operating types (Max-Coverage algorithm type, Boustrophedon path type, max quality value type, and max area type) were selected to compare quality and working capacity. Result: The working time of Max-Coverage algorithm type was shorter than others, and the total quality value of Max-Coverage algorithm and max quality value type were higher than others. Conclusion: The developed combine scheduling program using Max-Coverage algorithm will provide optimal operation and maximum quality in a limited area and time.

An Efficient Coverage Algorithm for Intelligent Robots with Deadline (데드라인을 고려하는 효율적인 지능형 로봇 커버리지 알고리즘)

  • Jeon, Heung-Seok;Jung, Eun-Jin;Kang, Hyun-Kyu;Noh, Sam-H.
    • The KIPS Transactions:PartA
    • /
    • v.16A no.1
    • /
    • pp.35-42
    • /
    • 2009
  • This paper proposes a new coverage algorithm for intelligent robot. Many algorithms for improving the performance of coverage have been focused on minimizing the total coverage completion time. However, if one does not have enough time to finish the whole coverage, the optimal path could be different. To tackle this problem, we propose a new coverage algorithm, which we call MaxCoverage algorithm, for covering maximal area within the deadline. The MaxCoverage algorithm decides the navigation flow by greedy algorithm for Set Covering Problem. The experimental results show that the MaxCoverage algorithm performs better than other algorithms for random deadlines.

Clustering Strategy Based on Graph Method and Power Control for Frequency Resource Management in Femtocell and Macrocell Overlaid System

  • Li, Hongjia;Xu, Xiaodong;Hu, Dan;Tao, Xiaofeng;Zhang, Ping;Ci, Song;Tang, Hui
    • Journal of Communications and Networks
    • /
    • v.13 no.6
    • /
    • pp.664-677
    • /
    • 2011
  • In order to control interference and improve spectrum efficiency in the femtocell and macrocell overlaid system (FMOS), we propose a joint frequency bandwidth dynamic division, clustering and power control algorithm (JFCPA) for orthogonal-frequency-division-multiple access-based downlink FMOS. The overall system bandwidth is divided into three bands, and the macro-cellular coverage is divided into two areas according to the intensity of the interference from the macro base station to the femtocells, which are dynamically determined by using the JFCPA. A cluster is taken as the unit for frequency reuse among femtocells. We map the problem of clustering to the MAX k-CUT problem with the aim of eliminating the inter-femtocell collision interference, which is solved by a graph-based heuristic algorithm. Frequency bandwidth sharing or splitting between the femtocell tier and the macrocell tier is determined by a step-migration-algorithm-based power control. Simulations conducted to demonstrate the effectiveness of our proposed algorithm showed the frequency-reuse probability of the FMOS reuse band above 97.6% and at least 70% of the frequency bandwidth available for the macrocell tier, which means that the co-tier and the cross-tier interference were effectively controlled. Thus, high spectrum efficiency was achieved. The simulation results also clarified that the planning of frequency resource allocation in FMOS should take into account both the spatial density of femtocells and the interference suffered by them. Statistical results from our simulations also provide guidelines for actual FMOS planning.