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

Arduino based Voice Recognition System

By

Hi guys

Now i m going to show you how to control 3 led lights with ardunio based
voice Recognition system...
Easy way to learn  Arduino...


Used parts :
   1) Arduino mega 2560
   2) 3 LED lights
   3) HC-06 Blutooth module http://www.instructables.com/id/Add-bluetooth-to-your-Arduino-project-ArduinoHC-06/
   4) Android App for voice recognition https://play.google.com/store/apps/details?id=robotspace.simplelabs.amr_voice&hl=en


Connecting digram

Above project source code you can find below link in GITHUB
https://github.com/Robinroy-peter/Arduino-based-Voice-Recognition-System-.git

//// Code////
///////////////////////////////////////////////////////////
//  Coded by Robinroy Peter    14/07/2016                //
///////////////////////////////////////////////////////////
String a;

void setup() {
   
    Serial.begin(9600); // opens serial port, sets data rate to 9600 bps
    Serial2.begin(9600); //for blutooth module
    pinMode(2,OUTPUT);
    pinMode(3,OUTPUT);
    pinMode(4,OUTPUT);
    digitalWrite(2,LOW);
    digitalWrite(3,LOW);
    digitalWrite(4,LOW);
}

void loop() {

    while(Serial2.available()) {
   
        a= Serial2.readString();// read the incoming data as string
       
        Serial.println(a);
   
    }
    if(a =="*1#"){
        digitalWrite(2,HIGH);
    }
    if(a =="*2#"){
        digitalWrite(3,HIGH);}
    if(a =="*3#"){
        digitalWrite(4,HIGH);}
    if(a =="*stop#"){
        digitalWrite(2,LOW);
        digitalWrite(3,LOW);
        digitalWrite(4,LOW);}
    if(a =="*lights on#"){
        digitalWrite(2,HIGH);
        digitalWrite(3,HIGH);
        digitalWrite(4,HIGH);}
    if(a =="*blink#"){
       while(a !="*stop#"){
          while(Serial2.available()) {
       
        a= Serial2.readString();// read the incoming data as string
       
        Serial.println(a);
       
        }
        if(a =="*stop#"){
          break;}
              digitalWrite(2,HIGH);
              delay(200);
              digitalWrite(3,HIGH);
              delay(200);
              digitalWrite(4,HIGH);
              delay(200);
              digitalWrite(2,LOW);
              delay(200);
              digitalWrite(3,LOW);
              delay(200);
              digitalWrite(4,LOW);
              delay(200);
        }
        }
        if(a =="*next#"){
        while(a !="*stop#"){
          while(Serial2.available()) {
       
        a= Serial2.readString();// read the incoming data as string
       
        Serial.println(a);
       
        }
        if(a =="*stop#"){
          break;}
              int del = 70;
              digitalWrite(4,LOW);
              digitalWrite(2,HIGH);
              delay(del);
              digitalWrite(2,LOW);
              digitalWrite(3,HIGH);
              delay(del);
              digitalWrite(3,LOW);
              digitalWrite(4,HIGH);
              delay(del);
              digitalWrite(3,LOW);
              digitalWrite(4,HIGH);
              delay(del);
              digitalWrite(4,LOW);
              digitalWrite(3,HIGH);
              delay(del);
              digitalWrite(3,LOW);
              digitalWrite(2,HIGH);
              delay(del);

        }
        }

}
//////////code end////////

Here used Voice Commands
 1) one           -switch on 1st led
 2) two           -switch on 2nd led
 3) three         -switch on 3rd led
 4) stop           -switch off all leds
 5) blink          -leds running a pattern
 6) next           -leds running another pattern
 7) lights on    -all leds on

Watch below video in youtube
 
 
Thank you guys plz subscribe me in youtube and follow me in facebook
youtube    : https://www.youtube.com/channel/UCTAWNE9T7PUNG5GtXRPvBJg
Facebook :https://www.facebook.com/mechatronsdevelopers/

Thank you ....

Comments

Post a Comment

Popular posts from this blog

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

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

Ros Topics : Ros Tutorial

By
Topics , Its look like pipe line connection between two or more nodes,This is the way to transfer data continuously within two nodes.    Each message in ROS is transported using named buses called topics. When a node sends a message through a topic, then we can say the node is publishing a topic. When a node receives a message through a topic, then we can say that the node is subscribing to a topic. The publishing node and subscribing node are not aware of each other's existence. We can even subscribe a topic that might not have any publisher. In short, the production of information and consumption of it are decoupled. Each topic has a unique name, and any node can access this topic and send data through it as long as  they have the right message type Ros topic have two types of method   1. topic publisher   2. topic subscriber  ROS has a tool to work with topics called rostopic . It is a command-line tool that gives us information about the topic or publishes
Post a Comment
Read more

Translate