Skip to main content

Featured post

A* ALGORITHM BASICS FOR PATH FINDING & HEURISTICS METHODS : ARTIFICIAL INTELLIGENCE

 A* ALGORITHM BASICS FOR PATH FINDING A* , widely used  known form of best-first search & path planning algorithm nowadays in mobile robots,games. this is the function for A*,                                     f(n) = g(n) + h(n) g ( n ) is the cost of the path from the start node to n , and h ( n ) is a heuristic function that estimates the cost of the cheapest path from n to the goal This will find cheapest f(n) value in neighbor nodes to archive goal node. check below image  A to B path finding with g(n),h(n),f(n) value In the final level check below image Now we will check the Algorithm // A* Search Algorithm 1. Initialize the open list 2. Initialize the closed list put the starting node on the open list (you can leave its f at zero) 3. while the open list is not empty a) find the node with the least f on the open list, call it "q" b) pop q off the open list c) generate q's 8 successors

Understanding ROS Nodes

Its a basic thing & main part in ROS.
Nodes are executables that can communicate with other processes using topics,
services, or the Parameter Server.
Node can be create in python , c++ , Lisp
Two nodes can communicate each other using topics (interchange meassage/data  )
Every nodes have to named by programmer.that name used to communicate or identified by other node.
roscpp is lib to create ros node in c++ & rospy for python language

In ROS have some  commands to retrieve the running nodes information

  • rosnode info node : This prints information about the node
  • rosnode kill node : This kills a running node or sends a given signal
  • rosnode list : This lists the active nodes
  • rosnode machine hostname : This lists the nodes running on a particular machine or lists the machines
  • rosnode ping node : This tests the connectivity to the node
  • rosnode cleanup : This purges registration information from unreachable nodes  
  • rqt_graph :  Provides a GUI plugin for visualizing the ROS computation graph.

roscore  is a collection of nodes and programs that are pre-requisites of a ROS-based system.roscore running is important to ros nodes communication

check it out how to use commands

Comments

Popular posts from this blog

Getting Started with ARGoS Large-Scale Swarm Robot Simulator in Ubuntu

ARGoS (Autonomous Robots Go Swarming) is a multi-robot simulator designed to support large teams of robots. Its design is pretty different from the design of other simulators. Its most distinctive feature is that the 3D simulated world can be divided in regions, and each region can be assigned to a different physics engine. Furthermore, ARGoS' design revolves around the concept of tunable accuracy. In other words, in ARGoS, everything is a plug-in (robot models, sensors, actuators, physics engines, visualisations, etc) and the user can select which plug-ins to use for an experiment.  Since different plug-ins have different accuracy and computational costs, users can choose which plug-ins to use for each aspect of the simulation and assign resources only where it matters. This makes the simulation as fast as possible. At the time of writing, ARGoS supports the Swarmanoid robots (foot-bot and eye-bot) and the e-puck. ARGoS supports Linux and Mac OSX. Binary packages are availa

A* ALGORITHM BASICS FOR PATH FINDING & HEURISTICS METHODS : ARTIFICIAL INTELLIGENCE

 A* ALGORITHM BASICS FOR PATH FINDING A* , widely used  known form of best-first search & path planning algorithm nowadays in mobile robots,games. this is the function for A*,                                     f(n) = g(n) + h(n) g ( n ) is the cost of the path from the start node to n , and h ( n ) is a heuristic function that estimates the cost of the cheapest path from n to the goal This will find cheapest f(n) value in neighbor nodes to archive goal node. check below image  A to B path finding with g(n),h(n),f(n) value In the final level check below image Now we will check the Algorithm // A* Search Algorithm 1. Initialize the open list 2. Initialize the closed list put the starting node on the open list (you can leave its f at zero) 3. while the open list is not empty a) find the node with the least f on the open list, call it "q" b) pop q off the open list c) generate q's 8 successors

Setting up Arduino lib in ROS & Arduino IDE

 Hi guys let see how to setup arduino with ros(robot operating system) Before this step u need to install arduino & ros in ubuntu Then after u need to copy & paste this code in ur terminal and press ENTER        sudo apt-get install ros-indigo-rosserial-arduino       sudo apt-get install ros-indigo-rosserial  press enter . then u need to find out arduino lib folder in ur HOME & open ther terminal on it then u need to copy & paste this code in that terminal          rosrun rosserial_arduino make_libraries.py  and press enter . then open the arduino IDE and upload a sample code in ur board  Now let see how to do in ros . check whether ur ros arduino lib is install or not. start the ros master using " roscore " connect the arduino with ros           roslaunch rosserial_python arduino_one.launch   in arduino publisher node name is chatter ..  we can check its work or not  using " rostopic list " we can display the chatter node u

Translate