Solutions to the characteristic equation for industrial robot’s elliptic trajectories

Božek, Pavol; Ivandić, Željko; Lozhkin, Alexander; Lyalin, V. E.; Tarasov, Vladimir

doi:10.17559/tv-20150114112458

Cited by 12 publications

(4 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Its combination with recent deep learning methods [69][70][71][72][73] should be investigated to handle large-scale processes and systems [74][75][76][77][78][79][80][81][82][83][84]. Additionally, we are interested in considering the application of IDJaya to practical scenarios, i.e., industrial robots [39][40][41], automatic guided vehicle (AGV) [85,86], autonomous driving [87], resource scheduling [88,89] and multi-agent systems [77,[90][91][92][93].…”

Section: Discussionmentioning

confidence: 99%

“…The application of the SPP extends to the realm of industrial automation. The SPP has been used to optimize and streamline processes, e.g., the design of mechanical components for automation platforms [39], measurement of industrial robot poses [40], and solution of characteristic equations for the elliptical trajectories of industrial robots [41].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An Improved Discrete Jaya Algorithm for Shortest Path Problems in Transportation-Related Processes

et al. 2023

View full text Add to dashboard Cite

Shortest path problems are encountered in many engineering applications, e.g., intelligent transportation, robot path planning, and smart logistics. The environmental changes as sensed and transmitted via the Internet of Things make the shortest path change frequently, thus posing ever-increasing difficulty for traditional methods to meet the real-time requirements of many applications. Therefore, developing more efficient solutions has become particularly important. This paper presents an improved discrete Jaya algorithm (IDJaya) to solve the shortest path problem. A local search operation is applied to expand the scope of solution exploration and improve solution quality. The time complexity of IDJaya is analyzed. Experiments are carried out on seven real road networks and dense graphs in transportation-related processes. IDJaya is compared with the Dijkstra and ant colony optimization (ACO) algorithms. The results verify the superiority of the IDJaya over its peers. It can thus be well utilized to meet real-time application requirements.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

An Improved Discrete Jaya Algorithm for Shortest Path Problems in Transportation-Related Processes

et al. 2023

View full text Add to dashboard Cite

show abstract

“…By using the fifth-order polynomial instead of the third-order polynomial, we can also control the acceleration of joints [20]. The third-order polynomial allows us only to control the position and velocity [21]. By derivation of p q i we get p .…”

Section: Simulation Of Locomotionmentioning

confidence: 99%

Investigation of Snake Robot Locomotion Possibilities in a Pipe

et al. 2020

View full text Add to dashboard Cite

This paper analyzed the locomotion of a snake robot in narrow spaces such as a pipe or channel. We developed a unique experimental snake robot with one revolute and one linear joint on each module, with the ability to perform planar motion. The designed locomotion pattern was simulated in MATLAB R2015b and subsequently verified by the experimental snake robot. The locomotion of the developed snake robot was also experimentally analyzed on dry and viscous surfaces. The paper further describes the investigation of locomotion stability by three symmetrical curves used to anchor static modules between the walls of the pipe. The stability was experimentally analyzed by digital image correlation using a Q-450 Dantec Dynamics high-speed correlation system. The paper presents some input symmetrical elements of locomotion and describes their influence on the results of locomotion. The results of simulations and experiments show possibilities of snake robot locomotion in a pipe.

show abstract

“…If the adhesive is applied on both parts, on the carrier material as well as on the laminate, the open time for the carrier material is 4 hours and for the laminate 12 hours. These values are only valid for an application temperature of 25 °C [4,5]. This system consists of robot ABB IRB 1600 type with controller IRC5, pressure pot with adhesive and painting gun RA5 HV3 from Krautzberger company, see Fig.…”

Section: Main Parameters Of Spraying Adhesivementioning

confidence: 99%

Testing of adhesive spray painting with robot

et al. 2017

View full text Add to dashboard Cite

Professional paperThis article aims at setting appropriate parameters for robotic spraying of adhesives used in industry. The robot ABB IRB 1600 was used in a nonexplosive environment. The adhesive was dispensed from pressure sweat and applied by a Krautzberger RA5 spray head. The article describes a detailed diagram for automatic connection of a painting gun. The results of the individual tests are shown in the tables and the dependencies of the individual parameters are described in the graphs. Depending on the amount of spray applied, the best samples are evaluated according to the adhesive manufacturer's recommendations. Keywords: adhesive; painting gun; pressure pot; robot Ispitivanje bojenja mlazom adhezivnog sredstva nanesenog robotomStručni članak Cilj je ovoga rada određivanje odgovarajućih parametara za raspršivanje adheziva korištenih u industriji uz primjenu robota. Korišten je robot ABB IRB 1600 u neeksplozivnom okruženju. Adheziv se oslobađao iz tlačne posude i nanosio raspršivačem Krautzberger RA5. U radu se daje detaljan opis dijagrama za automatsko spajanje pištolja za bojenje. Rezultati pojedinačnih testova dani su u tablicama, a ovisnosti pojedinih parametara prikazane su u grafikonima. Ovisno o količini nanesenog mlaza, najbolji uzorci su ocijenjeni u skladu s preporukama proizvođača adheziva.

show abstract

Solutions to the characteristic equation for industrial robot’s elliptic trajectories

Cited by 12 publications

References 4 publications

An Improved Discrete Jaya Algorithm for Shortest Path Problems in Transportation-Related Processes

An Improved Discrete Jaya Algorithm for Shortest Path Problems in Transportation-Related Processes

Investigation of Snake Robot Locomotion Possibilities in a Pipe

Testing of adhesive spray painting with robot

Contact Info

Product

Resources

About