activity
20112018
most citedFast Approximation Algorithms for Art Gallery Problems in Simple Polygons

3 citations · 7 across the 6 of their papers we have counts for

collaborators

6 papers

cs.RO2018

Sampling-Based Tour Generation of Arbitrarily Oriented Dubins Sensor Platforms

Doo-Hyun Cho, Dae-Sung Jang, Han-Lim Choi

This paper describes a formulation and develops a novel procedure for a fleet of unmanned aerial vehicles (UAVs) from the perspective of remotely executable tasks. In a complex mis…

cs.RO2016

Optimal Control-Based UAV Path Planning with Dynamically-Constrained TSP with Neighborhoods

Dae-Sung Jang, Hyeok-Joo Chae, Han-Lim Choi

This paper addresses path planning of an unmanned aerial vehicle (UAV) with remote sensing capabilities (or wireless communication capabilities). The goal of the path planning is t…

cs.CG2014★ 2 cited

Discretization of Planar Geometric Cover Problems

Dae-Sung Jang, Han-Lim Choi

We consider discretization of the 'geometric cover problem' in the plane: Given a set of points in the plane and a compact planar object , find a minimum cardinality c…

eess.SY2014★ 1 cited

Complexity Analysis of Heuristic Pulse Interleaving Algorithms for Multi-Target Tracking with Multiple Simultaneous Receive Beams

Dae-Sung Jang, Han-Lim Choi

This paper presents heuristic algorithms for interleaved pulse scheduling problems on multi-target tracking in pulse Doppler phased array radars that can process multiple simultane…

eess.SY2013★ 1 cited

Search Optimization for Minimum Load under Detection Performance Constraints in Multifunction Radars

Dae-Sung Jang, Han-Lim Choi, Ji-Eun Roh

This paper presents a solution procedure of search parameter optimization for minimum load ensuring desired one-off and cumulative probabilities of detection in a multifunction pha…

cs.CG2011★ 3 cited

Fast Approximation Algorithms for Art Gallery Problems in Simple Polygons

Dae-Sung Jang, Sun-Il Kwon

We present approximation algorithms with O(n^3) processing time for the minimum vertex and edge guard problems in simple polygons. It is improved from previous O(n^4) time algorith…