Skip to main content

Featured post

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

By
 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. ...
6 comments

Arduino + Ultrasonic range Finder Testing With small Automation concept

By
 Hi guys,I m Robinroy peter...plz help me to improve my journey  in ROBOTICS
                                 plz Subscribe  my blog and youtube also

    This is a simple testing work in arduino...
beginners  easily  learn  arduino  with my tute  ..my main aim is " i want to find interested people in thz field
with or without knowledge..HERE INTERESTING IS MAIN PART
If u want to Learn ardunio  ==>>>  https://www.arduino.cc/

Ok let we start...
Used parts in thz tute..

  1. Ardunio Mega 2560  ==>>https://www.arduino.cc/en/Main/arduinoBoardMega2560   
  2. Ultrasonic Range finder  ==>> http://www.instructables.com/id/Ultrasonic-Range-detector-using-Arduino-and-the-SR/?ALLSTEPS
  3. Servo Motor  http://www.instructables.com/id/Arduino-Servo-Motors/?ALLSTEPS
Thz s circuit digram 



this is a soruce code :--
###################################################################
 // ---------------------------------------------------------------------------
// Basic Testing codeed by Robinroy peter.
// ---------------------------------------------------------------------------

#include <NewPing.h>
#include <Servo.h>

Servo servo;  // create servo object to control a servo
//plz find servo attach pin is 9..thats defined in setup()
int val;    // variable to read the value from the analog pin

#define TRIGGER_PIN  12  // Arduino pin tied to trigger pin on the ultrasonic sensor.
#define ECHO_PIN     11  // Arduino pin tied to echo pin on the ultrasonic sensor.
#define MAX_DISTANCE 200 // Maximum distance we want to ping for (in centimeters). Maximum sensor distance is rated at 400-500cm.

NewPing ultra_sonic(TRIGGER_PIN, ECHO_PIN, MAX_DISTANCE); // NewPing setup of pins and maximum distance.

void setup() {
  Serial.begin(115200); // Open serial monitor at 115200 baud to see ping results.
  pinMode(13,OUTPUT);
  servo.attach(9);
   servo.write(val);
}

void loop() {
  
  delay(50);                     // Wait 50ms between pings (about 20 pings/sec). 29ms should be the shortest delay between pings.
  Serial.print("Ping: ");
  Serial.print(ultra_sonic.ping_cm()); // Send ping, get distance in cm and print result (0 = outside set distance range)
  Serial.println("cm");
   digitalWrite(13,LOW);
  if((5<ultra_sonic.ping_cm())&&(ultra_sonic.ping_cm()<30)){
    digitalWrite(13,HIGH);
    servo.write(160-val);
    }
    val = 160-val;
    delay(200);
   }
##########################################################################
##########################################################################
Thz is a  Testing video.. plz Subscribe  my blog and youtube also




THANK YOU FOR WATCHING .........PLZ SUBSCRIBE MY BLOG AND YOUTUBE...

Robinroy peter
Location: Kayts, Sri Lanka

Comments

Post a Comment

Popular posts from this blog

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

By
 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. ...
6 comments
Read more

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

By
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...
Post a Comment
Read more

How to compile C++ file in ROS environment

By
let see how make one c++ file as executable or make it compile in ros environment let create one package call test so we will add test1.cpp to compile, then we have to change in 3 place in cmakelist.txt file here test1.cpp we named this executable as test1   add_executable(test1 src/test1.cpp)    add_dependencies(test1 ${${PROJECT_NAME}_EXPORTED_TARGETS} ${catkin_EXPORTED_TARGETS})    target_link_libraries(test1    ${catkin_LIBRARIES}  )  these r the main changes we need to do in cmakelist. if we need to add another c++ file then let see  that's all lets compile for more details just check below video
Post a Comment
Read more

Translate