Fast collision checking for intelligent vehicle motion planning
We present a method for fast collision checking that is suitable for application in motion
planning for intelligent vehicles. One of the difficulties that arises in this domain is the fact …
planning for intelligent vehicles. One of the difficulties that arises in this domain is the fact …
Iterated dynamic thresholding search for packing equal circles into a circular container
Packing equal circles in a circle is a classic global optimization problem that has a rich
research history and a number of relevant applications. The problem is computationally …
research history and a number of relevant applications. The problem is computationally …
An approach for route optimization in applications of precision agriculture using UAVs
K Srivastava, PC Pandey, JK Sharma - Drones, 2020 - mdpi.com
This research paper focuses on providing an algorithm by which (Unmanned Aerial
Vehicles) UAVs can be used to provide optimal routes for agricultural applications such as …
Vehicles) UAVs can be used to provide optimal routes for agricultural applications such as …
Multi-scale cross-city community detection of urban agglomeration using signaling big data
Many existing efforts have taken advantage of large-scale spatial-temporal data to partition
cities via constructed human interaction networks. However, few studies focus on …
cities via constructed human interaction networks. However, few studies focus on …
Localization and indoor navigation for visually impaired using bluetooth low energy
B Nagarajan, V Shanmugam… - Smart Systems and IoT …, 2020 - Springer
Wireless personal networks such as infrared, Bluetooth, or wireless local area networks
such as Wi-Fi or a combination of both are widely used for navigation. Real-world …
such as Wi-Fi or a combination of both are widely used for navigation. Real-world …
Optimal circle covering problems and their applications
B Bánhelyi, E Palatinus, BL Lévai - Central European Journal of …, 2015 - Springer
We study a special type of circle covering problem, the complete cover of polygons by not
necessarily congruent circles with prescribed centres. We introduce a branch-and-bound …
necessarily congruent circles with prescribed centres. We introduce a branch-and-bound …
Covering polygons with discs: The problem of crane selection and location on construction sites
D Briskorn, M Dienstknecht - Omega, 2020 - Elsevier
Cranes are a key element in construction projects as they are the primary lifting equipment
and among the most expensive construction equipment. Thus, crane selection and location …
and among the most expensive construction equipment. Thus, crane selection and location …
A novel node placement for long belt coverage in wireless networks
Coverage is an important issue in many wireless networks. In this paper, we address the
problem of node placement for ensuring complete coverage in a long belt scenario and …
problem of node placement for ensuring complete coverage in a long belt scenario and …
A shape optimization approach to the problem of covering a two-dimensional region with minimum-radius identical balls
We investigate the problem of covering a region in the plane with the union of m identical
balls of minimum radius. The region to be covered may be disconnected, be nonconvex …
balls of minimum radius. The region to be covered may be disconnected, be nonconvex …
Svm-based nonparametric discriminant analysis, an application to face detection
D Prins, V Gool - Proceedings Ninth IEEE International …, 2003 - ieeexplore.ieee.org
Detecting the dominant normal directions to the decision surface is an established technique
for feature selection in high dimensional classification problems. Several approaches have …
for feature selection in high dimensional classification problems. Several approaches have …