Free Essay

Planning Algorithm

In:

Submitted By ravi5432345
Words 3041
Pages 13
Module 9
Planning
Version 2 CSE IIT,Kharagpur

Lesson 25
Planning algorithm - II
Version 2 CSE IIT,Kharagpur

9.4.5 Partial-Order Planning
Total-Order vs. Partial-Order Planners Any planner that maintains a partial solution as a totally ordered list of steps found so far is called a total-order planner, or a linear planner. Alternatively, if we only represent partial-order constraints on steps, then we have a partial-order planner, which is also called a non-linear planner. In this case, we specify a set of temporal constraints between pairs of steps of the form S1 < S2 meaning that step S1 comes before, but not necessarily immediately before, step S2. We also show this temporal constraint in graph form as
S1 +++++++++> S2

STRIPS is a total-order planner, as are situation-space progression and regression planners Partial-order planners exhibit the property of least commitment because constraints ordering steps will only be inserted when necessary. On the other hand, situation-space progression planners make commitments about the order of steps as they try to find a solution and therefore may make mistakes from poor guesses about the right order of steps.

Representing a Partial-Order Plan
A partial-order plan will be represented as a graph that describes the temporal constraints between plan steps selected so far. That is, each node will represent a single step in the plan (i.e., an instance of one of the operators), and an arc will designate a temporal constraint between the two steps connected by the arc. For example,
• • • • S1 ++++++++> S2 ++++++++++> |\ | \++++++++++++++++| | v ++++++> S3 ++++++> S4 ++++++ S5 ^ | |

graphically represents the temporal constraints S1 < S2, S1 < S3, S1 < S4, S2 < S5, S3 < S4, and S4 < S5. This partial-order plan implicitly represents the following three totalorder plans, each of which is consistent with all of the given constraints: [S1,S2,S3,S4,S5], [S1,S3,S2,S4,S5], and [S1,S3,S4,S2,S5].

9.5 Plan-Space Planning Algorithms
An alternative is to search through the space of plans rather than a space of situations. That is, we start with a simple, incomplete plan, which we call a partial plan. Then we consider ways of expanding the partial plan until we come up with a complete plan that

Version 2 CSE IIT,Kharagpur

solves the problem. We use this approach when the ordering of sub-goals affects the solution. Here one starts with a simple, incomplete plan, a partial plan, and we look at ways of expanding the partial plan until we come up with a complete plan that solves the problem. The operators for this search are operators on plans: adding a step, imposing an ordering that puts one step before another, instantiating a previously unbound variable, and so on. Therefore the solution is the final plan. Two types of operators are used:


Refinement operators take a partial plan and add constraints to it. They eliminate some plans from the set and they never add new plans to it. A modification operator debugs incorrect plans that the planner may make, therefore we can worry about bugs later.



9.5.1 Representation of Plans
A plan is formally defined as a data structure consisting of the following 4 components: 1. A set of plan steps 2. A set of step ordering constraints 3. A set of variable binding constraints 4. A set of causal links Example: Plan( STEPS:{S1:Op(ACTION: Start), S2:Op(ACTION: Finish, PRECOND: Ontable(c), On(b,c), On(a,b) }, ORDERINGS: {S1 < S2}, BINDINGS: {}, LINKS: {} )

Key Difference Between Plan-Space Planning and Situation-Space Planning In Situation-Space planners all operations, all variables, and all orderings must be fixed when each operator is applied. Plan-Space planners make commitments (i.e., what steps in what order) only as necessary. Hence, Plan-Space planners do least-commitment planning.

Version 2 CSE IIT,Kharagpur

Start Node in Plan Space The initial plan is created from the initial state description and the goal description by creating two "pseudo-steps:" Start
P: none E: all positive literals defining the initial state

Finish
P: literals defining the conjunctive goal to be achieved E: none

and then creating the initial plan as: Start ---------> Finish Searching Through Plan Space There are two main reasons why a given plan may not be a solution: Unsatisfied goal. That is, there is a goal or sub-goal that is not satisfied by the current plan steps. Possible threat caused by a plan step that could cause the undoing of a needed goal if that step is done at the wrong time So, define a set of plan modification operators that detect and fix these problems.

Example
• • •

Goal: Set the table, i.e., on(Tablecloth) ^ out(Glasses) ^ out(Plates) ^ out(Silverware) Initial State: clear(Table)

Operators: 1. Lay-tablecloth 2. P: clear(Table)
E: on(Tablecloth), ~clear(Table)

3. Put-out(x) 4. P: none
E: out(x), ~clear(Table) •

Searching for a Solution in Plan Space

Version 2 CSE IIT,Kharagpur

1. Initial Plan
Start -----------> Finish

2. Solve 4 unsolved goals in Finish by adding 4 new steps with the minimal temporal constraints possible: on(Tablecloth) Start ------> S1: Lay-tablecloth ------------------------>Finish \ \ \ out(Glasses) ^ ^ ^ \ \ \----> S2: Put-out(Glasses) -----------------| | | \ \ out(Plates) / / \ \-----> S3: Put-out(Plates) ------------------/ / \ out(Silverware) / \------> S4: Put-out(Silverware) ---------------/

3. Solve unsolved subgoal clear(Table) which is a precondition of step S1: clear(Table) on(Tablecloth) Start -----------> S1: Lay-tablecloth ---------------------->Finish \ \ \ out(Glasses) ^ ^ ^ \ \ \---------> S2: Put-out(Glasses) ---------------| | | \ \ out(Plates) | | \ \----------> S3: Put-out(Plates) -----------------/ | \ out(Silverware) / \-----------> S4: Put-out(Silverware) --------------/

4. Fix threats caused by steps S2, S3, and S4 on the link from Start to S1. That is, clear(Table) is a necessary precondition of S1 that is created by step Start. But S2 causes clear(Table) to be deleted (negated), so if S2 came before S1, clear(Table) wouldn't be true and step S1 couldn't be performed. Therefore, add a temporal constraint that forces S2 to come anytime after S1. That is, add constraint S1 < S2. Similarly, add S1 < S3, and S1 < S4, resulting in the new plan:

Version 2 CSE IIT,Kharagpur

clear(Table) on(Tablecloth) Start -----------> S1: Lay-tablecloth --------------------->Finish | | | |\--|---| ^ ^ ^ | | | | | v out(Glasses) | | | | | |--------------+---+-> S2: Put-out(Glasses) -------------/ | | | | | v out(Plates) / | | |----------------+-> S3: Put-out(Plates) -------------------/ | | v out(Silverware) / |---------------> S4: Put-out(Silverware) ---------------------/

5. No threats and no unsolved goals in this plan, so it is a complete plan (i.e., a solution to the planning problem). Any total ordering of the steps implied by this partial-order plan is a solution plan. Here, there are six possible plans, where the first step is S1, and the steps S2, S3, and S4 follow in any order. (Don't include the pseudo-steps Start and Finish.)

Interleaving vs. Non-Interleaving of Sub-Plan Steps
Given a conjunctive goal, G1 ^ G2, if the steps that solve G1 must either all come before or all come after the steps that solve G2, then the planner is called a non-interleaving planner. Otherwise, the planner allows interleaving of sub-plan steps. This constraint is different from the issue of partial-order vs. total-order planners. STRIPS is a noninterleaving planner because of its use of a stack to order goals to be achieved.

Partial-Order Planner (POP) Algorithm function pop(initial-state, conjunctive-goal, operators) // non-deterministic algorithm plan = make-initial-plan(initial-state, conjunctive-goal); loop: begin if solution?(plan) then return plan; (S-need, c) = select-subgoal(plan) ; // choose an unsolved goal choose-operator(plan, operators, S-need, c); // select an operator to solve that goal and revise plan resolve-threats(plan); // fix any threats created end end function solution?(plan)

Version 2 CSE IIT,Kharagpur

if causal-links-establishing-all-preconditions-of-all-steps(plan) and all-threats-resolved(plan) and all-temporal-ordering-constraints-consistent(plan) and all-variable-bindings-consistent(plan) then return true; else return false; end function select-subgoal(plan) pick a plan step S-need from steps(plan) with a precondition c that has not been achieved; return (S-need, c); end procedure choose-operator(plan, operators, S-need, c) // solve "open precondition" of some step choose a step S-add by either Step Addition: adding a new step from operators that has c in its Add-list or Simple Establishment: picking an existing step in Steps(plan) that has c in its Add-list; if no such step then return fail; add causal link "S-add --->c S-need" to Links(plan); add temporal ordering constraint "S-add < S-need" to Orderings(plan); if S-add is a newly added step then begin add S-add to Steps(plan); add "Start < S-add" and "S-add < Finish" to Orderings(plan); end end procedure resolve-threats(plan) foreach S-threat that threatens link "Si --->c Sj" in Links(plan) begin // "declobber" threat choose either Demotion: add "S-threat < Si" to Orderings(plan) or Promotion: add "Sj < S-threat" to Orderings(plan); if not(consistent(plan)) then return fail; end end

Plan Modification Operations
The above algorithm uses four basic plan modification operations to revise a plan, two for solving a goal and two for fixing a threat:


Establishment -- "Solve an Open Precondition" (i.e., unsolved goal) If a precondition p of a step S does not have a causal link to it, then it is not yet solved. This is called an open precondition. Two ways to solve: o Simple Establishment Find an existing step T prior to S in which p is necessarily true (i.e., it's in the Effects list of T). Then add causal link from T to S.

Version 2 CSE IIT,Kharagpur



Step Addition Add a new plan step T that contains in its Effects list p. Then add causal link from T to S. Declobbering -- Threat Removal A threat is a relationship between a step S3 and a causal link S1 --->p S2, where p is a precondition in step S2, that has the following form: o -------> S1 --------->p S2 | | -------> S3 ~p

• • •

That is, step S3 has effect ~p and from the temporal links could possibly occur inbetween steps S1 and S2, which have a causal link between them. If this occurred, then S3 would "clobber" the goal p "produced" by S1 before it can be "consumed" by S2. Fix by ensuring that S3 cannot occur in the "protection interval" in between S1 and S2 by doing either of the following:

o

Promotion Force threatening step to come after the causal link. I.e., add temporal link S2 < S3. Demotion Force threatening step to come before the causal link. I.e., add temporal link S3 < S1.

9.5.2 Simple Sock/Shoe Example
In the following example, we will show how the planning algorithm derives a solution to a problem that involves putting on a pair of shoes. In this problem scenario, Pat is walking around his house in his bare feet. He wants to put some shoes on to go outside. Note: There are no threats in this example and therefore is no mention of checking for threats though it a necessary step To correctly represent this problem, we must break down the problem into simpler, more atomic states that the planner can recognize and work with. We first define the Start operator and the Finish operator to create the minimal partial order plan. As mentioned before, we must simplify and break down the situation into smaller, more appropriate states. The Start operator is represented by the effects: ~LeftSockOn, ~LeftShoeOn, ~RightSockOn, and ~RightShoeOn. The Finish operator has the preconditions that we wish to meet: LeftShoeOn and RightShoeOn. Before we derive a plan that will allow Pat to reach his goal (i.e. satisfying the condition of having both his left and right shoe on) from the initial state of having nothing on, we need to define some operators to get us

Version 2 CSE IIT,Kharagpur

there. Here are the operators that we will use and the possible state (already mentioned above). Operators Op(ACTION: PutLeftSockOn() PRECOND:~LeftSockOn EFFECT: LeftSockOn) Op(ACTION: PutRightSockOn() PRECOND:~RightSockOn EFFECT: RightSockOn) Op(ACTION: PutLeftShoeOn() PRECOND:LeftSockOn EFFECT: LeftShoeOn) Op(ACTION: PutRightShoeOn() PRECOND:RightShoeOn EFFECT: RightShoeOn) States LeftSockOn, LeftShoeOn, RightSockOn, RightShoeOn Creating A Plan From the states listed above, we first create a minimal partial order plan. We can represent bare feet (Start operator) by saying that Pat is not wearing any socks or shoes and shoes on (Finish operator) with the two shoe on states. Here is the minimal partial order plan. Initially we have two preconditions to achieve; RightShoeOn and LeftShoeOn. Let's start with the condition of having our right shoe on. We must choose an operator that will result in this condition. To meet this condition we need to the operator 'PutRightShoeOn()'. We add the operator and create a causal link between it and the Finish operator. However, adding this operator results a new condition (i.e. precondition of PutRightShoeOn()) of having the right sock on.

Start ~LeftSockOn, ~LeftShoeOn, ~RightSockOn, ~RightShoeOn

RightSockOn, LeftSockOn PutRShoeOn( ) RightShoeOn

LeftShoeOn, RightShoeOn Finish

Version 2 CSE IIT,Kharagpur

At this point we still have two conditions to meet: having our left shoe on and having our right sock on. We continue by selecting one of these two preconditions and trying to achieve it. Let's pick the precondition of having our right sock on. To satisfy this condition, we must add another step, operator 'PutRightSockOn()'. The effects of this operator will satisfy the precondition of having our right sock on. At this point, we have achieved the ‘RightSockOn’ state. Since the precondition of the ‘PutRightSockOn()’ operator is one of the effects of the Start operator, we can simply draw a causal link between the two operators. These two steps can be repeated for Pat’s left shoe. The plan is complete when all preconditions are resolved.

The Partial Order Planning algorithm can be described as a form of regression planning that use the principle of least commitment. It starts with a minimal partial order plan that consists of a Start operator (initial state) and a Finish operator (goal state). It then chooses a precondition that has not been resolved and chooses an operator whose effect matches the precondition. It then checks if any threats were created by the addition of the operator and if one is detected, resolves it either by demoting the operator, promoting the operator, or backtracking (removing the operator). It continues to choose operators until a solution is found (i.e. all preconditions are resolved). Solutions created by the Partial Order Planning algorithm are very flexible. They may be executed in many ways. They can represent many different total order plans (partial order plans can be converted to total order plans using a process called linearization). Lastly they can more efficiently if steps are executed simultaneously.

Version 2 CSE IIT,Kharagpur

Questions
1. Consider the world of Shakey the robot, as shown below.

Shakey has the following six actions available: • Go(x,y), which moves Shakey from x to y. It requires Shakey to be at x and that x and y are locations in the same room. By convention a door between two rooms is in both of them, and the corridor counts as a room. • Push(b,x,y), which allows Shakey to push a box b from location x to location y. Both Shakey and the box must be at the same location before this action can be used. • ClimbUp(b,x), which allows Shakey to climb onto box b at location x. Both Shakey and the box must be at the same location before this action can be used. Also Shakey must be on the Floor. • ClimbDown(b,x), which allows Shakey to climb down from a box b at location x. Shakey must be on the box and the box must be in location x before this action can be used. • TurnOn(s,x), which allows Shakey to turn on switch s which is located at location x. Shakey must be on top of a box at the switch’s location before this action can be used. • TurnOff(s,x), which allows Shakey to turn off switch s which is located at location x. Shakey must be on top of a box at the switch’s location before this action can be used. Using STRIPS syntax, define the six actions from above. In your action definitions, use only the following predicates: Box(b) to mean that b is a box, In(x,r) to mean that location x is in room r, At(x,y) to mean that the object x is at location y, ShakeyOn(x) to mean that Shakey is on the object x, Switch(s) to mean that s is a switch, and SwitchOn(s) to mean

Version 2 CSE IIT,Kharagpur

that the switch s is on. You may also use the constants Shakey and Floor in the action definitions. 2. In the above problem, using STRIPS, define the initial state depicted on the previous page. Use only the predicates from part (a) and the constants Box1, Box2, Switch1, Switch2, Floor,Shakey, Room1, Room2, Corridor, LDoor1, LDoor2, LShakeyStart, LSwitch1, LBox1Start, LBox2Start,LSwitch2. The Lx constants are intended to represent the locations of x, 3. Provide a totally ordered plan for Shakey to turn off Switch2 using the actions and the initial state defined in (2) and (3). 4. Consider the inconsistent partially ordered plan below. Identify the conflicts in this plan and show all ways of resolving them that follow the principle of least commitment. For each solution, draw the new partially ordered plan, and list all of its linearizations.

Solutions
1. STRIPS description of the operators are:

2. The initial state is:

Version 2 CSE IIT,Kharagpur

3. The plan is

4. Conflicts: • ActionC cannot come between Start and ActionA. • ActionD cannot come between ActionA and ActionB. Resolution 1:

Linearizations of Resolution 1: (ActionA abbreviated as A, and so on…) Start, D, A, B, C, Finish Start, D, A, C, B, Finish Resolution 2:

Linearizations of Resolution 2: (ActionA abbreviated as A, and so on…) Start, A, B, D, C, Finish

Version 2 CSE IIT,Kharagpur

Start, A, B, C, D, Finish Start, A, C, B, D, Finish

Version 2 CSE IIT,Kharagpur

Similar Documents

Free Essay

Calorie Management Program

...PRG/211 – Week 5 Team B – Algorithm Planning Visual Logic CALORIE MANAGEMENT PROGRAM Week 2 Algorithm Planning Week 3 Program Variables for Calorie Management Week 4 Verification & workaround for Calorie Management Week 5 Learning Team Assignment ****************************************************** About the Assignment Imagine that your team of software developers won a contract to develop a program that will identify whether a person is balancing calories consumed with those being expended or burned by taking the following into account:   The balance of calories is calculated daily. Calories are consumed in both food and beverages. Calories can be identified from both product labeling and calorie counters located on the Internet. Calories are burned daily in both daily living and exercise. Calories expended or burned can be calculated using calorie calculators located on the Internet. The balance of calories may be displayed in either calories or pounds and ounces. The following are examples of the information that might be provided: Calories are in balance. _ _ _ more calories are consumed than expended. _ _ _ more calories are expended than consumed. No pounds/ounces were gained or lost. _ pounds _ _ ounces may have been gained. _ pounds _ _ ounces may have been lost. Use the following computation: One pound equals 3500 calories. THE PLAN Identify the criteria TEAM B will need to develop the required software. To do this, Team B must...

Words: 1400 - Pages: 6

Premium Essay

It- 3rd Year

...E-COMMERCE (TIT-501) UNIT I Introduction What is E-Commerce, Forces behind E-Commerce Industry Framework, Brief history of ECommerce, Inter Organizational E-Commerce Intra Organizational E-Commerce, and Consumer to Business Electronic Commerce, Architectural framework Network Infrastructure for E-Commerce Network Infrastructure for E-Commerce, Market forces behind I Way, Component of I way Access Equipment, Global Information Distribution Network, Broad band Telecommunication. UNIT-II Mobile Commerce Introduction to Mobile Commerce, Mobile Computing Application, Wireless Application Protocols, WAP Technology, Mobile Information Devices, Web Security Introduction to Web security, Firewalls & Transaction Security, Client Server Network, Emerging Client Server Security Threats, firewalls & Network Security. UNIT-III Encryption World Wide Web & Security, Encryption, Transaction security, Secret Key Encryption, Public Key Encryption, Virtual Private Network (VPM), Implementation Management Issues. UNIT - IV Electronic Payments Overview of Electronics payments, Digital Token based Electronics payment System, Smart Cards, Credit Card I Debit Card based EPS, Emerging financial Instruments, Home Banking, Online Banking. UNIT-V Net Commerce EDA, EDI Application in Business, Legal requirement in E -Commerce, Introduction to supply Chain Management, CRM, issues in Customer Relationship Management. References: 1. Greenstein and Feinman, “E-Commerce”, TMH 2. Ravi Kalakota, Andrew Whinston...

Words: 2913 - Pages: 12

Premium Essay

Program Design and Tools

...PROGRAM DESIGN TOOLS Algorithms, Flow Charts, Pseudo codes and Decision Tables Designed by Parul Khurana, LIECA. Introduction • The various tools collectively referred to as program design tools, that helps in planning the program are:– Algorithm. – Flowchart. – Pseudo-code. Designed by Parul Khurana, LIECA. Algorithms • An algorithm is defined as a finite sequence of instructions defining the solution of a particular problem, where each instruction is numbered. • However, in order to qualify as an algorithm, every sequence of instructions must satisfy the following criteria: Designed by Parul Khurana, LIECA. Algorithms • Input: There are zero or more values which are externally supplied. • Output: At least one value is produced. • Definiteness: Each step must be clear and unambiguous, i.e., having one and only one meaning. • Finiteness: If we trace the steps of an algorithm, then for all cases, the algorithm must terminate after a finite number of steps. Designed by Parul Khurana, LIECA. Algorithms • Effectiveness: Each step must be sufficiently basic that it can in principle be carried out by a person using only one paper and pencil. – In addition, not only each step is definite, it must also be feasible. Designed by Parul Khurana, LIECA. Formulation of Algorithm • Formulate an algorithm to display the nature of roots of a quadratic equation of the type: ax2 + bx + c = 0 provided a ≠ 0 Designed by Parul Khurana, LIECA. Formulation...

Words: 914 - Pages: 4

Premium Essay

Pdf. Input Out Files

...call System Analysis and Design programmers do to understand a problem. Many diagrams including "Work Break Down Structure", "Workflow Diagram" and "Class Diagrams" are some of the most common ones are used. Question 2. What is Pseaudocode? Pseudocode is an informal high-level description of the operating principle of a computer program or other algorithm. It uses the structural conventions of a programming language, but is intended for human reading rather than machine reading. Pseudocode typically omits details that are not essential for human understanding of the algorithm, such as variable declarations, system-specific code and some subroutines. The programming language is augmented with natural language description details, where convenient, or with compact mathematical notation. The purpose of using pseudocode is that it is easier for people to understand than conventional programming language code, and that it is an efficient and environment-independent description of the key principles of an algorithm. It is commonly used in textbooks and scientific publications that are documenting various algorithms, and also in planning of computer program development, for sketching out the structure of the program before the actual coding takes place. Question 3 computer programmers normally perform what 3 steps? 1. Input is received. 2. Some process is performed on the input. 3. Output is produced. Question 4 What does user friendly mean? 2. user friendly" means...

Words: 330 - Pages: 2

Premium Essay

Pt1420 Unit 3 Assignment 1 Algorithm Essay

...1. Explain what software you used to create your game To create my game, a software called “Scratch was used. Scratch is a software that is downloadable on most PC’s, people can use this program to share interactive media. This is includes self-made games as well as animations. 2. Explain what an algorithm is  An algorithm is a process, or a set of rules to be followed in calculations or other problem-solving operations, especially by a computer. However, algorithms are used in our day to day life, whether you notice or not. For example; a daily routine, or a cooking recipe. 3. Explain what an if statement is An if statement is a “block” or a piece of code that when one thing happens, it will do that, but if another happens, it will do something else. For example, when...

Words: 653 - Pages: 3

Premium Essay

Pta Nhi

...Sinha Computer Fundamentals: Pradeep K. Sinha & Priti Sinha Ref Page Chapter 11: Planning the Computer Program Slide 1/44 Computer Fundamentals: Pradeep K. Sinha & Priti Sinha Computer Fundamentals: Pradeep K. Sinha & Priti Sinha Learning Objectives In this chapter you will learn about: § Programs must be planned before they are written § Algorithm § Flowchart § Pseudocode § Plan the logic of a computer program § Commonly used tools for program planning and their use Ref Page 183 Chapter 11: Planning the Computer Program Slide 2/44 Computer Fundamentals: Pradeep K. Sinha & Priti Sinha Computer Fundamentals: Pradeep K. Sinha & Priti Sinha Purpose of Program Planning § To write a correct program, a programmer must write each and every instruction in the correct sequence § Logic (instruction sequence) of a program can be very complex § Hence, programs must be planned before they are written to ensure program instructions are: § Appropriate for the problem § In the correct sequence Ref Page 183 Chapter 11: Planning the Computer Program Slide 3/44 Computer Fundamentals: Pradeep K. Sinha & Priti Sinha Computer Fundamentals: Pradeep K. Sinha & Priti Sinha Algorithm § Refers to the logic of a program and a step-by-step description of how to arrive at the solution of a given problem § In order to qualify as an algorithm, a sequence of instructions must have following characteristics: § Each and every instruction...

Words: 3284 - Pages: 14

Premium Essay

Cross-Docking

...Multiple-product & Various Truck Capacities Cross-docking Problem Introduction Customer demands are getting more complicated and even harder to be satisfied nowadays. It is highly needed for the company to have such flexibility, agility and reliability in terms of answering the demand requests from their customers. But their limitations in improving customer satisfaction might be a big problem for them and the operation of single company can have a bad impact on those of the other companies in the supply chain, meaning that if one company fails to fulfill the demands required, it will affect the related companies and obviously will put them in jeopardy in terms of customers trust and the cost they would have to spend. Therefore, improving supply chain management is really attractive for those companies looking to efficiently improve their customer satisfaction. Apte and Viswanathan (2000) stated that distribution process is responsible for 30% of an item price and this is the reason why there are a lot of companies trying their very best to develop new distribution strategies in order to manage their product flow in efficient manner. Cross docking is definitely one of those strategies people believe to be an efficient strategy to minimize inventory and to reduce cycle times. Apte and Viswanathan (2000) also defined cross docking as the continuous process to the final destination through the cross-dock storing products and materials in the distribution center. When cross-docking...

Words: 1829 - Pages: 8

Free Essay

Layout

...limitations, type of output obtained, and some other general characteristics. Quantitative and computer-based models will sometimes produce odd layout shapes. For this reason, optimization models and computer programs designed to plan facility layouts, based on optimizing certain objectives, can be useful only for determining some guidelines for the planners. While these models can be used for planning alternative layouts, considerations of qualitative and personnel factors should be given during the layout finalization phase. INTRODUCTION One of the tasks in layout planning is assigning relative locations to a set of facilities. The best layout plan is often the one that results in the highest overall effectiveness of transactions between the facilities. Cost considerations can be a major factor in choosing a given alternative layout plan for implementation. The problem of facility layout is well covered in the literature. Some models are based on the analysis of the relative location of facilities. A graphical approach, a quantitative procedure and a quadratic assignment algorithm were developed by Buffa[1], Wimmert[2] and Hillier & Connors[3], respectively. A large mixed-integer goal-programming model...

Words: 3517 - Pages: 15

Premium Essay

Pt1420 Unit 1 Problem Solving

...1. Analyze: Define the problem. Be sure you understand what the program should do-that is, what the output should be. Have a clear idea of what data are given and the relationship between the input and the desired output. 2. Design: Plan the solution to the problem. Develop the algorithm (the logical sequence of precise steps that solve the problem). All detail, including obvious steps, should seem in the algorithm. Translate the algorithm into a logic plan using any of the popular methods that is flowcharts, pseudo code, top down charts. These design tools help the programmer break a problem into an order of small tasks the computer can perform to rectify the problem. Planning also includes using representative data to test the logic of...

Words: 451 - Pages: 2

Free Essay

Innovation and Erp Systems

...Scheme and Syllabus of B.E. (Computer Science and Engineering) 3 rd th TO 8 Semester 2014-2015 University Institute of Engineering and Technology, Panjab University, Chandigarh DEPARTMENT: COMPUTER SCIENCE AND ENGINEERING VISION: To be recognized as an international leader in Computer Science and Engineering education and research to benefit society globally. MISSION: · · · · To move forward as frontiers of human knowledge to enrich the citizen, the nation, and the world. To excel in research and innovation that discovers new knowledge and enables new technologies and systems. To develop technocrats, entrepreneurs, and business leaders of future who will strive to improve the quality of human life. To create world class computing infrastructure for the enhancement of technical knowledge in field of Computer Science and Engineering. PROGRAMME: B.E. CSE (UG PROGRAMME) PROGRAMME EDUCATIONAL OBJECTIVES: I. Graduates will work as software professional in industry of repute. II. Graduates will pursue higher studies and research in engineering and management disciplines. III. Graduates will work as entrepreneurs by establishing startups to take up projects for societal and environmental cause. PROGRAMME OUTCOMES: A. Ability to effectively apply knowledge of computing, applied sciences and mathematics to computer science & engineering problems. B. Identify, formulate, research literature, and analyze complex computer science & engineering problems reaching substantiated conclusions...

Words: 23989 - Pages: 96

Free Essay

Personal Information

...MIZAN TEPI UNIVERSITY, Ethiopia From oct,18,2010… to till date Key strengths include:      Curriculum & Development Backward Design Unit Planning Student Evaluation & Assessment Progress Monitoring Honors & College Readiness      Practical based instruction Content oriented Classroom Management Program Development College-to-career Connection EDUCATION & CERTIFICATION:  B.Sc., (Computer Science and IT) with 3.25 GPA at Wollega University, Ethiopia. TECHNICAL PROFILE: Programming Languages Database Technologies GUI Tools Web Technologies Operating System Packages Multimedia Application Professional Experience:  Presently working as Assistant Lecturer in Mizan-Tepi University, Ethiopia for B.Sc(CS & IT) and I have delivered Courses Introduction to Computer Science, Fundamentals of Programming I and II, Professional Ethics In computing, Fundamentals of Database Systems, Data Structures and Algorithms, Computer Organization and Architecture, Data Communication and Computer Networking, Object Oriented Programming, Operating Systems, Internet Programming I ,Advanced Database System, Internet Programming II, Unix System Administration, System Analysis and Design, Event Driven Programming, Information Retrieval, Software Engineering, Formal Language Theory, Logic for Computer Science, Computer Graphics, Analysis of Algorithms, Introduction to : : : : : : : C, C++,VB-5,6,VB.net ,C#, Java,python MySQL,Oracle 9i, 10 and 11g, MS SQL Server 7.0,weka DreamWeaver,Developer2000...

Words: 506 - Pages: 3

Premium Essay

Calorie Management

...PRG/211 Algorithm Planning for Calorie Management Algorithm Planning for Calorie Management 1. We need to analyze the program.              By determining the information we are given and what results we need to get. What information do we need to calculate the calories daily. What calories are in the food and beverages. How many calories are burned daily. What is the required balance per person.  2. Design a program to solve the program.             The heart of the program development process.  3. Code the program.             Write statements in a computer language that will design what we need in the program. 4. Test the program.  Make sure the program solves the given problem. Make sure we are able to calculate the user's daily calorie balance.  Determine the modules that will be needed in the program. User Intake – Breakfast, Lunch, Dinner, Snacks, Drink User Activity – Sedentary, Light Active, Moderate Active, Very Active, and Extremely Active Pseudocode for Calorie Management Input Data Module Write “What was your daily meal calorie intake?” Input calorieIntake Write “Select your daily activity” Input dailyActivity Calorie Caluctions Module Set Totalcalories = calorieIntake- dailActivity Output Module Write “Your total calorie intake is: `` + Totalcalories End This a simple pseudocode for the calorie management program. The key variable are calorieintake the...

Words: 372 - Pages: 2

Free Essay

Gfngf

...Chapter 2 REVIEW OF RELATED LITERATURE AND STUDIES Now a days, technologies become usually a part of our daily life. Research has become increasingly important for the field of business today. Company or Institution must base their statements on verified facts. In addition one might be able to absorb and learned this research study. The literature and studies cited in this chapter tackle the prospects of Company and Institution, as well as the process of Computer monitoring system. FOREIGN LITERATURE AND STUDIES There has been a significant amount of previous work done in the monitoring of computer hardware device. In particular, Mohammed EL Shobaki conduct a study, “On-chip Monitoring for Non-Intrusive Hardware/Software Observability” bears the most similarity to this work. In this thesis work the authors propose a solution to the problem where the monitoring and troubleshooting of computer hardware device become important part in maintaining observability of the computer system. He stated that today’s computer-based products are complex and require extensive efforts to design and test. They are complex because they comprise many components, complex software and hardware, and features a lot of functionality. This is a trend which is clearly seen in the consumer electronics market, and in state-of-the-art industrial systems. The development of these products tends to be as challenging as it is increasingly time consuming, expensive, and error-prone. Therefore, the developers...

Words: 1551 - Pages: 7

Premium Essay

Syllabus

... 4. 5. 6. CSE411 CSE461 CSE412 CSE462 CSE414 CSE464 Subject Title Scheme of Teaching L 3 0 3 0 3 0 T 1 0 1 0 1 0 P 0 3 0 3 0 3 Hours 4 3 4 3 4 3 Credit 4 2 4 2 4 2 University External Marks 50 50 50 CSE361 CSE313 CSE363 AS301 EC316 EC366 EC317 EC367 Data Structures (Practical) Peripheral Devices & Interfaces Hardware Lab (Practical) Engineering Mathematics – III Digital Electronics Digital Electronics (Practical) Microprocessors Microprocessors (Practical) 0 3 0 3 3 0 3 0 15 0 1 0 1 1 0 1 0 5 3 0 2 0 0 2 0 2 09 3 4 2 4 4 2 4 2 29 2 4 1 4 4 1 4 1 25 50 50 50 50 250 Internal Total Sessional Marks 50 50 50 50 50 50 50 50 50 450 100 50 100 50 100 100 50 100 50 700 7. 8. Total ASC405 CSE 415 Analysis & Design of Algorithms Analysis & Design of Algorithms (Practical) Database Management System Database Management System (Practical) Object Oriented Programming Object Oriented Programming (Practical) Cyber Law & IPR Computer Architecture & Organization Internal Total Sessional Marks 50 100 50 50 50 50 50 50 100 50 100 50 3 3 15 0 1 4 0 0 9 3 4 28 3 4 25 50 50 250 50 50 400 100 100 650 2 Scheme of Examination of B.E. in Computer Science & Engineering Third Year - Fifth Semester Sr. Paper Subject Title Scheme of Teaching Univesity Internal Sessional Code External L T P Hou Credit Marks Total Marks rs s 1. CSE511 Operating System 3 1 0 4 4 50 50...

Words: 14784 - Pages: 60

Premium Essay

An Evolution of Computer Science Research

...Abbreviated version of this report is published as "Trends in Computer Science Research" Apirak Hoonlor, Boleslaw K. Szymanski and M. Zaki, Communications of the ACM, 56(10), Oct. 2013, pp.74-83 An Evolution of Computer Science Research∗ Apirak Hoonlor, Boleslaw K. Szymanski, Mohammed J. Zaki, and James Thompson Abstract Over the past two decades, Computer Science (CS) has continued to grow as a research field. There are several studies that examine trends and emerging topics in CS research or the impact of papers on the field. In contrast, in this article, we take a closer look at the entire CS research in the past two decades by analyzing the data on publications in the ACM Digital Library and IEEE Xplore, and the grants awarded by the National Science Foundation (NSF). We identify trends, bursty topics, and interesting inter-relationships between NSF awards and CS publications, finding, for example, that if an uncommonly high frequency of a specific topic is observed in publications, the funding for this topic is usually increased. We also analyze CS researchers and communities, finding that only a small fraction of authors attribute their work to the same research area for a long period of time, reflecting for instance the emphasis on novelty (use of new keywords) and typical academic research teams (with core faculty and more rapid turnover of students and postdocs). Finally, our work highlights the dynamic research landscape in CS, with its focus constantly ...

Words: 15250 - Pages: 61