Article Per Year (5 Year)
p-Index From 2021 - 2026
0.817
P-Index
This Author published in this journals
All Journal Jurnal Matematika E-Jurnal Matematika
G.K. GANDHIADI
Unknown Affiliation
Mathematics

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

 1 
ALGORITMA PENGATURAN KINEMATIKA ROBOT REDUNDANT UNTUK MENGHINDARI TERJADINYA TUMBUKAN BERDASARKAN SKEMA PRIORITAS TUGAS GEDE SANTI ASTAWA; G.K. GANDHIADI
Jurnal Matematika Vol. 1, No. 1 April 2007
Publisher : Mathematics Department, Faculty of Mathematics and Natural Sciences, Udayana University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24843/JMAT.2007.v01.i01.p02

Abstract

A redundant manipulator has more degree of freedom than minimal needed to do its job. Inthis condition the manipulator can easily do the job, and can say become not optimal. To makethe manipulator more optimal, we try to add some obstacles that must be avoided by themanipulator. in calculation process we use inverse kinematics method in task priority scheme.From the simulation result, it is looked that by adding some jobs do not annoy the main job ofmanipulator, and those prove that the priority of the job can help manipulator do that job moreoptimal.
PENCARIAN LINTASAN TERPENDEK DENGAN ALGORITME DIJKSTRA DAN MINIMUM SPANNING TREE DENGAN ALGORITME SOLLIN TERHADAP PERJALANAN WISATA SEJARAH DI KABUPATEN SUMENEP LIKA HANIFA; LUH PUTU IDA HARINI; G.K. GANDHIADI
E-Jurnal Matematika Vol. 14 No. 3 (2025)
Publisher : Mathematics Department, Faculty of Mathematics and Natural Sciences, Udayana University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24843/MTK.2025.v14.i03.p485

Abstract

A graph is a diagram that contains specific information.  One concept in graphs that can solve real-life problems is the concept of trees, which consists of various types of trees used to solve problems in life, such as finding the minimum path using the Dijkstra algorithm and the use of minimum spanning trees using the Sollin algorithm. This research produced the minimum path using Dijkstra's Algorithm and the minimum spanning tree using Sollin's Algorithm, which were applied to historical tourist routes in Sumenep Regency.
Co-Authors ALEXANDER JOSEPH RIADI Desak Putu Eka Nilakusmawati EKA N. KENCANA I Gede Santi Astawa I KOMANG GDE SUKARSA LIKA HANIFA LUH PUTU IDA HARINI Made Susilawati Ni Luh Putu Suciptawati PRISCELLA PURBA SARIFUL MUNAWAROH