Now showing 1 - 8 of 8
  • Some of the metrics are blocked by your 
    Item type:Publication,
    Searching energy-efficient route in rough terrain for mobile robot with ant algorithm
    Recently, the ant algorithm has been widely used to solve the problem for searching optimized route from various different paths. It can be applied for searching an appropriate route that consumes less energy in mobile robot area as well. However, the previous optimized routes resulting from the ant algorithms considered only in flat terrain environment. They did not mention rough terrain environment. For the rough terrain, the optimized results might not be optimized in term of energy, due to slopes contained inside. This paper presents the application of ant algorithms for searching energy-efficient route of mobile robot in the rough terrain environment. The conventional ant colony optimization (ACO) algorithm and the adapted ACO algorithm are used to find the optimized routes in terms of distance and energy for comparison. The experimental results showed that, by using the speed with distance weighting factor, the adapted ACO yielded the optimized distance and energy in the flat terrain. In the rough terrain, the adapted ACO could also provide the energy-efficient routes better than the flat terrain. However, it could not be comparable with the ACO in some case and is required further improvement. © Springer-Verlag Berlin Heidelberg 2012.
  • Some of the metrics are blocked by your 
    Item type:Publication,
    Runner BIB number recognition system
    (2017-12-13) ;
    Chaorattana, Wanatphong
    ;
    Boonchoay, Jutatip
    This research represents the runner BIB number recognition system to develop image processing study which solves problems and increases efficiency about runner image management in running fairs. The runner BIB number recognition system processes runner image to recognize BIB number and time when runner appears in media. The information from processing has collected to applicative later. BIB number position is on BIB tag which attach on runner body. To recognize BIB number, the system detects runner position first. This process emphasize on runner face detection in images following to concept of researcher then find BIB number in body-thigh area of runner. The system recognizes BIB number from BIB tag which represents in media. This processing presents 0.80 in precision value, 0.81 in recall value and F-measure is 0.80. The results display the runner BIB number recognition system has developed with high efficiency and can be applied for runner online communities in actual situation. The runner BIB number recognition system decreases problems about runner image processing and increases comfortable for runners when find images from running fairs. Moreover, the system can be applied in commercial to increase benefits in running business.
  • Some of the metrics are blocked by your 
    Item type:Publication,
    Searching energy-efficient route for mobile robot with ant algorithm
    Recently, the ant algorithm has been widely used to solve the problem of searching for optimization route from various different paths. The ant algorithm can also be applied for searching an appropriate route that consumes less energy in mobile robot area, which is similar problem domain. However, in order to apply, the ant algorithm is required to adapt due to the factor of energy that must be considered in addition to the distance alone. This paper presents the adaptation of ant algorithm to solve the problem of searching energy-efficient route for mobile robot. The adapted ant algorithm deploys a speed, which is employed to find the energy to move the robot in each route, to generate pheromones used to define the probability that the ants will choose for the best route. Then, the distance is used as a weighting factor to discover the energy-efficient route in terms of distance and speed by simulation. The results from adapted ant algorithm are also used to compare with the conventional ant algorithm for investigation. The simulation results expressed that, when using the speed with the distance to weight, the average distance is shortest. Consequently, when transforming into the energy, the result is much lower as well. Therefore, the adaptation of ant algorithm can improve the result of searching problem for optimization route that consumes less energy, which is a limited resource of mobile robot. © 2011 ICROS.
  • Some of the metrics are blocked by your 
    Item type:Publication,
    An Image-based Sea Turtle Identification using Postorbital Facial Feature Points Matching Technique
    (2019-10-01) ;
    Pantuwong, Natapon
    Our natural environment and ecological system has recently become an alarming global concern due to the increase in worldwide pollution levels. Identifying individual wildlife is essential for understanding population and conservation planning. This paper takes this problem into account which focuses on the sea turtle. Traditionally, sea turtle individuals are identified through the application of external flipper tags or internal passive integrated transponders. However, such devices might be lost. This paper proposes a method to perform sea turtle identification using image recognition technique. This idea could be possible because each sea turtle has a unique postorbital facial pattern. To avoid light condition and color problem, we create a mesh of facial pattern, and use it as an image for matching process. The proposed method uses a modification of SIFT feature extraction technique to extract feature vector from the input facial image. The modification of SIFT is proposed to increase robustness against affine transform. The Euclidean distance with Optimize Random Sample Algorithm is used to calculate the matching score. According to the experimental result, the overall accuracy is 99.92%, which shows the good performance of our method.
  • Some of the metrics are blocked by your 
    Item type:Publication,
    Searching optimization route by using Pareto solution with ant algorithm for mobile robot in rough terrain environment
    A problem related to searching routes of a mobile robot involves finding the route that has the shortest distance and consumes the least energy, or an energy-efficient route. An ant colony optimization (ACO) algorithm can be used to solve this problem, but only on a flat terrain, since energy is depended on the distance. The adapted ACO can also be applied for searching the energy-efficient routes in the rough terrain, but it is difficult to achieve both criteria, simultaneously. In the rough terrain, the least energy route might not have the shortest distance. Also, the route having the shortest distance might not consume the least energy. In this scenario, an optimized route is required. This paper proposes a method to find the optimized route of a mobile robot in terms of energy and distance on the rough terrain by using a Pareto solution with adapted ACO algorithm. In the proposed method, the adapted ACO is applied for searching a set of routes that consumes the least energy. Then, the Pareto solution is deployed to find the optimized route in terms of energy and distance. The experiment was conducted by simulation to verify the proposed searching method. The experimental result shows that the optimized route having appropriate energy and distance can be found. It can be implied that this optimized route is the energy-efficient route in rough terrain environment.
  • Some of the metrics are blocked by your 
    Item type:Publication,
    An application of Pareto solution with adapted ACO for searching optimal route of a mobile robot in rough terrain environment
    A challenge in searching an optimal route of a mobile robot involves finding the route that has the shortest distance and consumes the least energy. To solve this problem, an ant colony optimization (ACO) algorithm can be used, but only on a flat terrain, since the energy depends directly on the distance. In a rough terrain, the least energy route might not be the shortest distance. Also, the shortest distance route might not be the least energy. This is due to a factor of slope in the route. Although our adapted ACO can be used for searching energy-efficient routes in the rough terrain, it is difficult to achieve the shortest distance simultaneously. This paper proposes a novel method to find an optimal route of a mobile robot in rough terrain environment by using a Pareto solution with adapted ACO. In the proposed method, the adapted ACO is used to search two sets of route, i.e., one contains the least energy and another one contains the shortest distance. Then, the Pareto solution is deployed to find the optimal route in terms of energy and distance by adopting a distance vector for selection. The experiment was performed by simulation to verify the proposed searching method. The experimental results show that the proposed searching method can prescribe the optimal value for choosing the route provided by adapted ACO.
  • Some of the metrics are blocked by your 
    Item type:Publication,
    An application of ant algorithm for searching energy-efficient route a mobile robot takes using energy as a weighting factor
    A problem related to energy consumption of a mobile robot involves finding out what route the robot can take that uses the least energy. An ant colony optimization algorithm (ACO) can solve this problem. However, it is applicable only for route on a flat terrain. This paper proposes an adapted ant colony optimization (adapted ACO) algorithm that is applicable for route on a rough terrain as well. This adaptation introduces a weight that is the energy expended on a route that may have upward slopes, downward slopes, and flat surfaces. Experiments were conducted to test the algorithm. The experimental results show that our adapted ACO did successfully find a route that expended the least energy, though it was not the shortest one. We also found the following interesting facts: an energy-efficient route has more downward slopes than upward ones; the energy expended increases with the steepness of the slopes along a route; and the energy expended is likely to be lower if the robot’s velocity is not constrained to be constant throughout the route.
  • Some of the metrics are blocked by your 
    Item type:Publication,
    Mobile application for recovering paralysis patient’s motion
    (2018-12-10) ;
    Jantamongkollert, Thiti
    ;
    Sungkhawijit, Mathurin
    Paralysis is a symptom when patient’s central nervous system is failure because of blood deficiency. The patients cannot comfortably move their bodies due to muscle hyposthenia. The restoration requires regularly physical therapy which needs high accuracy because muscles have dysfunctional. This thesis represents the mobile application which help to muscle restoration of paralysis patient. This mobile application improves accuracy and efficiency of physical therapy. The physical therapy and muscle operation principles are collected and analyzed by this mobile application then collaborates with iBeacons sensors which properly control paralysis patient’s motion.