We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Shortest Paths between two Points in Space for Self Managed Digital Systems

by Manoj Kumar
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 100 - Number 13
Year of Publication: 2014
Authors: Manoj Kumar
10.5120/17582-8284

Manoj Kumar . Shortest Paths between two Points in Space for Self Managed Digital Systems. International Journal of Computer Applications. 100, 13 ( August 2014), 1-3. DOI=10.5120/17582-8284

@article{ 10.5120/17582-8284,
author = { Manoj Kumar },
title = { Shortest Paths between two Points in Space for Self Managed Digital Systems },
journal = { International Journal of Computer Applications },
issue_date = { August 2014 },
volume = { 100 },
number = { 13 },
month = { August },
year = { 2014 },
issn = { 0975-8887 },
pages = { 1-3 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume100/number13/17582-8284/ },
doi = { 10.5120/17582-8284 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:29:50.107252+05:30
%A Manoj Kumar
%T Shortest Paths between two Points in Space for Self Managed Digital Systems
%J International Journal of Computer Applications
%@ 0975-8887
%V 100
%N 13
%P 1-3
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In this paper, It has been proved that there can be more than one shortest path between two different points in space for self managed digital systems with finite memory space. Also, a formula has been given, that can be used to find total number of different paths between given two points.

References
  1. Donald Hearn and M. Pauline Baker. Computer Graphics C version. Dorling Kindersley (India) Pvt. Ltd. , Licensees of Pearson Education in South Asia, 2008.
  2. Edgar A. Kraut. Fundamentals of Mathematical Physics. Dover Publications, 2007.
  3. V. Rajaraman and T. Radhakrishnan. An Introduction to Digital Computer Design. Prentice-Hall of India Private Limited New Delhi, fourth edition, June 1998.
  4. James A. Storer and John H. Reif. Shortest paths in the plane with polygon obstacles. Journal of the Association for Computing Machinery, 41, No. 5:982–1012, september 1994.
Index Terms

Computer Science
Information Sciences

Keywords

Shortest Paths Robotics Self Managed Digital Systems Space Movement of Digital Systems Robot Motion Minimal Movement Problem

Powered by PhDFocusTM