Victor Parque

Prof. Victor Parque

orcid

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
21 January 2020 in IEEE Access
Verified
Journal Article
Open access
MAMohamed Abdelwahab
Mohamed Abdelwahab
Victor ParqueVictor Parque
Victor Parque
AEAhmed M. R. Fath Elbab
Ahmed M. R. Fath Elbab
AAA. A. Abouelsoud
A. A. Abouelsoud
SSShigeki Sugano
Shigeki Sugano
Being trajectory tracking key for safe mobile robot navigation, Fuzzy Logic (FL) has been useful in tackling uncertainty and imprecision to realize robust and smooth trajectory tracking. In this paper, we present the Z-number based Fuzzy Logic control for trajectory tracking of differential wheeled mobile robots. The unique point of our approach lies in the ability to encode constraint and reliability in multi-input and multi-output rules, whose antecedent universe considers only the instantaneous measurements of distance and the orientation gaps, and whose consequent universe is computed by the interpolative reasoning and the graded mean integration approach. As a consequence, not only our approach avoids the complexity of encoding error gradients, but also is advantageous to model versatile control rules able to cope with missing observations and noisy inducements on actuators. Our experiments using both physics-based simulations and real-world tests based on a Pioneer 3DX robot architecture have elucidated the superior efficacy and the feasibility of the proposed controller regarding accuracy, robustness, and smoothness compared to other well-known related frameworks such as Fuzzy Logic Type 1, Fuzzy Logic Type 2 and Fuzzy Logic with PID. Our results provide unique insights to realize generalizable algorithms aided by FL and Z-number towards robust trajectory tracking.

15 March 2023 in Sensors
Verified
Journal Article
Open access
PDF file
HOHammed Obasekore
Hammed Obasekore
MFMohamed Fanni
Mohamed Fanni
SASabah Mohamed Ahmed
Sabah Mohamed Ahmed
Victor ParqueVictor Parque
Victor Parque
BKbo-yeong kang
bo-yeong kang
Accurately detecting early developmental stages of insect pests (larvae) from off-the-shelf stereo camera sensor data using deep learning holds several benefits for farmers, from simple robot configuration to early neutralization of this less agile but more disastrous stage. Machine vision technology has advanced from bulk spraying to precise dosage to directly rubbing on the infected crops. However, these solutions primarily focus on adult pests and post-infestation stages. This study suggested using a front-pointing red-green-blue (RGB) stereo camera mounted on a robot to identify pest larvae using deep learning. The camera feeds data into our deep-learning algorithms experimented on eight ImageNet pre-trained models. The combination of the insect classifier and the detector replicates the peripheral and foveal line-of-sight vision on our custom pest larvae dataset, respectively. This enables a trade-off between the robot’s smooth operation and localization precision in the pest captured, as it first appeared in the farsighted section. Consequently, the nearsighted part utilizes our faster region-based convolutional neural network-based pest detector to localize precisely. Simulating the employed robot dynamics using CoppeliaSim and MATLAB/SIMULINK with the deep-learning toolbox demonstrated the excellent feasibility of the proposed system. Our deep-learning classifier and detector exhibited 99% and 0.84 accuracy and a mean average precision, respectively.

23 August 2022 in Computers and Electronics in Agriculture
Verified
Journal Article
Closed access
FEFrank Efe Erukainure
Frank Efe Erukainure
Victor ParqueVictor Parque
Victor Parque
MHMohsen A. Hassan
Mohsen A. Hassan
AFAhmed M.R. FathEl-Bab
Ahmed M.R. FathEl-Bab

28 April 2020 in IEEE Access
Verified
Journal Article
Open access
Victor ParqueVictor Parque
Victor Parque
TMTomoyuki Miyashita
Tomoyuki Miyashita
Mobile robots have recently attracted the attention and applicability in field areas ubiquitously. Within the context of autonomous navigation, path planning is relevant for comfortability, safety, execution time and energy savings. In this paper, we propose an approach to suggest smooth paths from observed robot trajectories by optimizing fitting and smoothness criteria using Differential Evolution with distinct modes of initialization, selection pressure, exploration and exploitation. Our rigorous computational experiments using a relevant set of real-world robot trajectories from the Boe-Bot mobile robot architecture show the feasibility and efficiency of our approach in computing smooth curves, suggesting the superior performance of the greedy initialization scheme based on the triangular convex hull of the robot trajectory, and Differential Evolution with exploitative and parameter adaptation schemes such as Rank-Based Differential Evolution (RBDE), Adaptive Differential Evolution with External Archive (JADE) and Strategy Adaptation Differential Evolution (SADE). Our obtained results offer the building blocks to further advance towards developing data-driven curve fitting and path planning algorithms, which may find use in several real-world applications in Robotics and Operations Research.

1 February 2017
Verified
Conference Paper
Closed access
Victor ParqueVictor Parque
Victor Parque
TMTomoyuki Miyashita
Tomoyuki Miyashita
Directed graphs encode meaningful dependencies among objects ubiquitously. This paper introduces new and simple representations for labeled directed graphs with the properties of being succinct (space is information-theoretically optimal); in which we avoid exploiting a-priori knowledge on digraph regularity such as triangularity, separability, planarity, symmetry and sparsity. Our results have direct implications to model directed graphs by using single integer numbers effectively, which is significant to enable canonical (generation of graph instances is unique) and efficient (coding and decoding take polynomial time) encodings for learning and optimization algorithms. To the best of our knowledge, the proposed representations are the first known in the literature.

1 October 2014
Verified
Conference Paper
Closed access
Victor ParqueVictor Parque
Victor Parque
MKMasakazu Kobayashi
Masakazu Kobayashi
MHMasatake Higashi
Masatake Higashi
Graphs denote useful dependencies among objects ubiquitously. This paper introduces new and simple bijections to the integer grid to enable the succinct, canonical and efficient representations of labeled graphs; whereas previous work has focused on regularities in structure such as triangularity, separability, planarity, symmetry and sparsity. By succinct we imply that space is information-theoretically optimal, by canonical we imply that generation of instances is unique, and by efficient we imply that coding and decoding take polynomial time. Our results have direct implications to handle labeled graphs by using single numbers efficiently, which is significant to enable the canonical graph encodings in learning and optimization algorithms. Our bijections are the first known in the literature.